Base Ten to Base Two: Unsigned Number 84 934 592 Converted and Written in Base Two. Natural Number (Positive Integer, No Sign) Converted From Decimal System to Binary Code

Base ten unsigned number 84 934 592(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;
  • 84 934 592 ÷ 2 = 42 467 296 + 0;
  • 42 467 296 ÷ 2 = 21 233 648 + 0;
  • 21 233 648 ÷ 2 = 10 616 824 + 0;
  • 10 616 824 ÷ 2 = 5 308 412 + 0;
  • 5 308 412 ÷ 2 = 2 654 206 + 0;
  • 2 654 206 ÷ 2 = 1 327 103 + 0;
  • 1 327 103 ÷ 2 = 663 551 + 1;
  • 663 551 ÷ 2 = 331 775 + 1;
  • 331 775 ÷ 2 = 165 887 + 1;
  • 165 887 ÷ 2 = 82 943 + 1;
  • 82 943 ÷ 2 = 41 471 + 1;
  • 41 471 ÷ 2 = 20 735 + 1;
  • 20 735 ÷ 2 = 10 367 + 1;
  • 10 367 ÷ 2 = 5 183 + 1;
  • 5 183 ÷ 2 = 2 591 + 1;
  • 2 591 ÷ 2 = 1 295 + 1;
  • 1 295 ÷ 2 = 647 + 1;
  • 647 ÷ 2 = 323 + 1;
  • 323 ÷ 2 = 161 + 1;
  • 161 ÷ 2 = 80 + 1;
  • 80 ÷ 2 = 40 + 0;
  • 40 ÷ 2 = 20 + 0;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 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 84 934 592(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):

84 934 592(10) = 101 0000 1111 1111 1111 1100 0000(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)