Base Two: Unsigned Base Ten Number 747 810 882 Converted To Base Two Binary Code. The Natural Number (Positive Integer, No Sign) Converted From Decimal System and Written As Binary Code

Base ten unsigned number 747 810 882(10) converted and written as a base two binary code

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when getting a quotient that is equal to zero.


  • division = quotient + remainder;
  • 747 810 882 ÷ 2 = 373 905 441 + 0;
  • 373 905 441 ÷ 2 = 186 952 720 + 1;
  • 186 952 720 ÷ 2 = 93 476 360 + 0;
  • 93 476 360 ÷ 2 = 46 738 180 + 0;
  • 46 738 180 ÷ 2 = 23 369 090 + 0;
  • 23 369 090 ÷ 2 = 11 684 545 + 0;
  • 11 684 545 ÷ 2 = 5 842 272 + 1;
  • 5 842 272 ÷ 2 = 2 921 136 + 0;
  • 2 921 136 ÷ 2 = 1 460 568 + 0;
  • 1 460 568 ÷ 2 = 730 284 + 0;
  • 730 284 ÷ 2 = 365 142 + 0;
  • 365 142 ÷ 2 = 182 571 + 0;
  • 182 571 ÷ 2 = 91 285 + 1;
  • 91 285 ÷ 2 = 45 642 + 1;
  • 45 642 ÷ 2 = 22 821 + 0;
  • 22 821 ÷ 2 = 11 410 + 1;
  • 11 410 ÷ 2 = 5 705 + 0;
  • 5 705 ÷ 2 = 2 852 + 1;
  • 2 852 ÷ 2 = 1 426 + 0;
  • 1 426 ÷ 2 = 713 + 0;
  • 713 ÷ 2 = 356 + 1;
  • 356 ÷ 2 = 178 + 0;
  • 178 ÷ 2 = 89 + 0;
  • 89 ÷ 2 = 44 + 1;
  • 44 ÷ 2 = 22 + 0;
  • 22 ÷ 2 = 11 + 0;
  • 11 ÷ 2 = 5 + 1;
  • 5 ÷ 2 = 2 + 1;
  • 2 ÷ 2 = 1 + 0;
  • 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.


Number 747 810 882(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):

747 810 882(10) = 10 1100 1001 0010 1011 0000 0100 0010(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 ten to base two

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)