Unsigned: Integer ↗ Binary: 10 010 011 Convert the Positive Integer (Whole Number) From Base Ten (10) To Base Two (2), Conversion and Writing of Decimal System Number as Unsigned Binary Code

Unsigned (positive) integer number 10 010 011(10)
converted and written as an unsigned binary (base 2) = ?

1. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.

  • division = quotient + remainder;
  • 10 010 011 ÷ 2 = 5 005 005 + 1;
  • 5 005 005 ÷ 2 = 2 502 502 + 1;
  • 2 502 502 ÷ 2 = 1 251 251 + 0;
  • 1 251 251 ÷ 2 = 625 625 + 1;
  • 625 625 ÷ 2 = 312 812 + 1;
  • 312 812 ÷ 2 = 156 406 + 0;
  • 156 406 ÷ 2 = 78 203 + 0;
  • 78 203 ÷ 2 = 39 101 + 1;
  • 39 101 ÷ 2 = 19 550 + 1;
  • 19 550 ÷ 2 = 9 775 + 0;
  • 9 775 ÷ 2 = 4 887 + 1;
  • 4 887 ÷ 2 = 2 443 + 1;
  • 2 443 ÷ 2 = 1 221 + 1;
  • 1 221 ÷ 2 = 610 + 1;
  • 610 ÷ 2 = 305 + 0;
  • 305 ÷ 2 = 152 + 1;
  • 152 ÷ 2 = 76 + 0;
  • 76 ÷ 2 = 38 + 0;
  • 38 ÷ 2 = 19 + 0;
  • 19 ÷ 2 = 9 + 1;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 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 10 010 011(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):

10 010 011(10) = 1001 1000 1011 1101 1001 1011(2)

Spaces were used to group digits: for binary, by 4, for decimal, by 3.

More operations on unsigned integer numbers:

» Unsigned (positive) integer number 10 010 010 converted from decimal system (from base 10) and written as an unsigned binary (in base 2) = ?

» Unsigned (positive) integer number 10 010 012 converted from decimal system (from base 10) and written as an unsigned binary (in base 2) = ?

The latest positive (unsigned) integer numbers converted from decimal system (written in base ten) to unsigned binary (written in base two)

Convert and write the decimal system (written in base ten) positive integer number 29 270 (with no sign) as a base two unsigned binary number Apr 20 09:07 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 765 433 (with no sign) as a base two unsigned binary number Apr 20 09:07 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 111 101 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 3 333 333 356 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 25 021 932 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 61 745 582 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 6 926 641 919 065 874 806 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 1 110 218 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 100 010 010 046 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
Convert and write the decimal system (written in base ten) positive integer number 700 079 (with no sign) as a base two unsigned binary number Apr 20 09:06 UTC (GMT)
All the decimal system (written in base ten) positive integers (with no sign) converted to unsigned binary (in base 2)

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)