Convert 1 000 100 109 949 to Unsigned Binary (Base 2)

See below how to convert 1 000 100 109 949(10), the unsigned base 10 decimal system number to base 2 binary equivalent

What are the required steps to convert base 10 decimal system
number 1 000 100 109 949 to base 2 unsigned binary equivalent?

  • A number written in base ten, or a decimal system number, is a number written using the digits 0 through 9. A number written in base two, or a binary system number, is a number written using only the digits 0 and 1.

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when you get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 1 000 100 109 949 ÷ 2 = 500 050 054 974 + 1;
  • 500 050 054 974 ÷ 2 = 250 025 027 487 + 0;
  • 250 025 027 487 ÷ 2 = 125 012 513 743 + 1;
  • 125 012 513 743 ÷ 2 = 62 506 256 871 + 1;
  • 62 506 256 871 ÷ 2 = 31 253 128 435 + 1;
  • 31 253 128 435 ÷ 2 = 15 626 564 217 + 1;
  • 15 626 564 217 ÷ 2 = 7 813 282 108 + 1;
  • 7 813 282 108 ÷ 2 = 3 906 641 054 + 0;
  • 3 906 641 054 ÷ 2 = 1 953 320 527 + 0;
  • 1 953 320 527 ÷ 2 = 976 660 263 + 1;
  • 976 660 263 ÷ 2 = 488 330 131 + 1;
  • 488 330 131 ÷ 2 = 244 165 065 + 1;
  • 244 165 065 ÷ 2 = 122 082 532 + 1;
  • 122 082 532 ÷ 2 = 61 041 266 + 0;
  • 61 041 266 ÷ 2 = 30 520 633 + 0;
  • 30 520 633 ÷ 2 = 15 260 316 + 1;
  • 15 260 316 ÷ 2 = 7 630 158 + 0;
  • 7 630 158 ÷ 2 = 3 815 079 + 0;
  • 3 815 079 ÷ 2 = 1 907 539 + 1;
  • 1 907 539 ÷ 2 = 953 769 + 1;
  • 953 769 ÷ 2 = 476 884 + 1;
  • 476 884 ÷ 2 = 238 442 + 0;
  • 238 442 ÷ 2 = 119 221 + 0;
  • 119 221 ÷ 2 = 59 610 + 1;
  • 59 610 ÷ 2 = 29 805 + 0;
  • 29 805 ÷ 2 = 14 902 + 1;
  • 14 902 ÷ 2 = 7 451 + 0;
  • 7 451 ÷ 2 = 3 725 + 1;
  • 3 725 ÷ 2 = 1 862 + 1;
  • 1 862 ÷ 2 = 931 + 0;
  • 931 ÷ 2 = 465 + 1;
  • 465 ÷ 2 = 232 + 1;
  • 232 ÷ 2 = 116 + 0;
  • 116 ÷ 2 = 58 + 0;
  • 58 ÷ 2 = 29 + 0;
  • 29 ÷ 2 = 14 + 1;
  • 14 ÷ 2 = 7 + 0;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

2. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

1 000 100 109 949(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

1 000 100 109 949 (base 10) = 1110 1000 1101 1010 1001 1100 1001 1110 0111 1101 (base 2)

Spaces were used to group digits: for binary, by 4, for decimal, by 3.

How to convert unsigned integer numbers (positive) from decimal system (base 10) to binary = simply convert from base 10 to base 2

Follow the steps below to convert a base ten unsigned integer number to base two:

  • 1. Divide repeatedly by 2 the positive integer number that has to be converted to binary, keeping track of each remainder, until we get a QUOTIENT that is equal to ZERO.
  • 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).

Example: convert the positive integer number 55 from decimal system (base ten) to binary code (base two):

  • 1. Divide repeatedly 55 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder;
    • 55 ÷ 2 = 27 + 1;
    • 27 ÷ 2 = 13 + 1;
    • 13 ÷ 2 = 6 + 1;
    • 6 ÷ 2 = 3 + 0;
    • 3 ÷ 2 = 1 + 1;
    • 1 ÷ 2 = 0 + 1;
  • 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above:
  • 55(10) = 11 0111(2)
  • Number 5510, positive integer (no sign), converted from decimal system (base 10) to unsigned binary (base 2) = 11 0111(2)
}?>