Convert 101 101 167 to Unsigned Binary (Base 2)

See below how to convert 101 101 167(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 101 101 167 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;
  • 101 101 167 ÷ 2 = 50 550 583 + 1;
  • 50 550 583 ÷ 2 = 25 275 291 + 1;
  • 25 275 291 ÷ 2 = 12 637 645 + 1;
  • 12 637 645 ÷ 2 = 6 318 822 + 1;
  • 6 318 822 ÷ 2 = 3 159 411 + 0;
  • 3 159 411 ÷ 2 = 1 579 705 + 1;
  • 1 579 705 ÷ 2 = 789 852 + 1;
  • 789 852 ÷ 2 = 394 926 + 0;
  • 394 926 ÷ 2 = 197 463 + 0;
  • 197 463 ÷ 2 = 98 731 + 1;
  • 98 731 ÷ 2 = 49 365 + 1;
  • 49 365 ÷ 2 = 24 682 + 1;
  • 24 682 ÷ 2 = 12 341 + 0;
  • 12 341 ÷ 2 = 6 170 + 1;
  • 6 170 ÷ 2 = 3 085 + 0;
  • 3 085 ÷ 2 = 1 542 + 1;
  • 1 542 ÷ 2 = 771 + 0;
  • 771 ÷ 2 = 385 + 1;
  • 385 ÷ 2 = 192 + 1;
  • 192 ÷ 2 = 96 + 0;
  • 96 ÷ 2 = 48 + 0;
  • 48 ÷ 2 = 24 + 0;
  • 24 ÷ 2 = 12 + 0;
  • 12 ÷ 2 = 6 + 0;
  • 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.

101 101 167(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

101 101 167 (base 10) = 110 0000 0110 1010 1110 0110 1111 (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)
}?>