Convert 29 012 036 to Unsigned Binary (Base 2)

See below how to convert 29 012 036(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 29 012 036 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;
  • 29 012 036 ÷ 2 = 14 506 018 + 0;
  • 14 506 018 ÷ 2 = 7 253 009 + 0;
  • 7 253 009 ÷ 2 = 3 626 504 + 1;
  • 3 626 504 ÷ 2 = 1 813 252 + 0;
  • 1 813 252 ÷ 2 = 906 626 + 0;
  • 906 626 ÷ 2 = 453 313 + 0;
  • 453 313 ÷ 2 = 226 656 + 1;
  • 226 656 ÷ 2 = 113 328 + 0;
  • 113 328 ÷ 2 = 56 664 + 0;
  • 56 664 ÷ 2 = 28 332 + 0;
  • 28 332 ÷ 2 = 14 166 + 0;
  • 14 166 ÷ 2 = 7 083 + 0;
  • 7 083 ÷ 2 = 3 541 + 1;
  • 3 541 ÷ 2 = 1 770 + 1;
  • 1 770 ÷ 2 = 885 + 0;
  • 885 ÷ 2 = 442 + 1;
  • 442 ÷ 2 = 221 + 0;
  • 221 ÷ 2 = 110 + 1;
  • 110 ÷ 2 = 55 + 0;
  • 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 number:

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

29 012 036(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

29 012 036 (base 10) = 1 1011 1010 1011 0000 0100 0100 (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)