Convert 32 456 994 to Unsigned Binary (Base 2)

See below how to convert 32 456 994(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 32 456 994 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;
  • 32 456 994 ÷ 2 = 16 228 497 + 0;
  • 16 228 497 ÷ 2 = 8 114 248 + 1;
  • 8 114 248 ÷ 2 = 4 057 124 + 0;
  • 4 057 124 ÷ 2 = 2 028 562 + 0;
  • 2 028 562 ÷ 2 = 1 014 281 + 0;
  • 1 014 281 ÷ 2 = 507 140 + 1;
  • 507 140 ÷ 2 = 253 570 + 0;
  • 253 570 ÷ 2 = 126 785 + 0;
  • 126 785 ÷ 2 = 63 392 + 1;
  • 63 392 ÷ 2 = 31 696 + 0;
  • 31 696 ÷ 2 = 15 848 + 0;
  • 15 848 ÷ 2 = 7 924 + 0;
  • 7 924 ÷ 2 = 3 962 + 0;
  • 3 962 ÷ 2 = 1 981 + 0;
  • 1 981 ÷ 2 = 990 + 1;
  • 990 ÷ 2 = 495 + 0;
  • 495 ÷ 2 = 247 + 1;
  • 247 ÷ 2 = 123 + 1;
  • 123 ÷ 2 = 61 + 1;
  • 61 ÷ 2 = 30 + 1;
  • 30 ÷ 2 = 15 + 0;
  • 15 ÷ 2 = 7 + 1;
  • 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.

32 456 994(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

32 456 994 (base 10) = 1 1110 1111 0100 0001 0010 0010 (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)
}?>