Unsigned: Integer ↗ Binary: 240 345 315 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 240 345 315(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;
  • 240 345 315 ÷ 2 = 120 172 657 + 1;
  • 120 172 657 ÷ 2 = 60 086 328 + 1;
  • 60 086 328 ÷ 2 = 30 043 164 + 0;
  • 30 043 164 ÷ 2 = 15 021 582 + 0;
  • 15 021 582 ÷ 2 = 7 510 791 + 0;
  • 7 510 791 ÷ 2 = 3 755 395 + 1;
  • 3 755 395 ÷ 2 = 1 877 697 + 1;
  • 1 877 697 ÷ 2 = 938 848 + 1;
  • 938 848 ÷ 2 = 469 424 + 0;
  • 469 424 ÷ 2 = 234 712 + 0;
  • 234 712 ÷ 2 = 117 356 + 0;
  • 117 356 ÷ 2 = 58 678 + 0;
  • 58 678 ÷ 2 = 29 339 + 0;
  • 29 339 ÷ 2 = 14 669 + 1;
  • 14 669 ÷ 2 = 7 334 + 1;
  • 7 334 ÷ 2 = 3 667 + 0;
  • 3 667 ÷ 2 = 1 833 + 1;
  • 1 833 ÷ 2 = 916 + 1;
  • 916 ÷ 2 = 458 + 0;
  • 458 ÷ 2 = 229 + 0;
  • 229 ÷ 2 = 114 + 1;
  • 114 ÷ 2 = 57 + 0;
  • 57 ÷ 2 = 28 + 1;
  • 28 ÷ 2 = 14 + 0;
  • 14 ÷ 2 = 7 + 0;
  • 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.


Number 240 345 315(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):

240 345 315(10) = 1110 0101 0011 0110 0000 1110 0011(2)

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

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

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)