Base Ten to Base Two: Unsigned Number 99 991 319 Converted and Written in Base Two. Natural Number (Positive Integer, No Sign) Converted From Decimal System to Binary Code

Base ten unsigned number 99 991 319(10) converted and written as a base two binary code

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when getting a quotient that is equal to zero.


  • division = quotient + remainder;
  • 99 991 319 ÷ 2 = 49 995 659 + 1;
  • 49 995 659 ÷ 2 = 24 997 829 + 1;
  • 24 997 829 ÷ 2 = 12 498 914 + 1;
  • 12 498 914 ÷ 2 = 6 249 457 + 0;
  • 6 249 457 ÷ 2 = 3 124 728 + 1;
  • 3 124 728 ÷ 2 = 1 562 364 + 0;
  • 1 562 364 ÷ 2 = 781 182 + 0;
  • 781 182 ÷ 2 = 390 591 + 0;
  • 390 591 ÷ 2 = 195 295 + 1;
  • 195 295 ÷ 2 = 97 647 + 1;
  • 97 647 ÷ 2 = 48 823 + 1;
  • 48 823 ÷ 2 = 24 411 + 1;
  • 24 411 ÷ 2 = 12 205 + 1;
  • 12 205 ÷ 2 = 6 102 + 1;
  • 6 102 ÷ 2 = 3 051 + 0;
  • 3 051 ÷ 2 = 1 525 + 1;
  • 1 525 ÷ 2 = 762 + 1;
  • 762 ÷ 2 = 381 + 0;
  • 381 ÷ 2 = 190 + 1;
  • 190 ÷ 2 = 95 + 0;
  • 95 ÷ 2 = 47 + 1;
  • 47 ÷ 2 = 23 + 1;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 5 ÷ 2 = 2 + 1;
  • 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 99 991 319(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):

99 991 319(10) = 101 1111 0101 1011 1111 0001 0111(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 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)