Signed: Integer ↗ Binary: 100 000 000 002 Convert the Integer Number to a Signed Binary. Converting and Writing the Base Ten Decimal System Signed Integer as Binary Code (Written in Base Two)

Signed integer number 100 000 000 002(10)
converted and written as a signed 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;
  • 100 000 000 002 ÷ 2 = 50 000 000 001 + 0;
  • 50 000 000 001 ÷ 2 = 25 000 000 000 + 1;
  • 25 000 000 000 ÷ 2 = 12 500 000 000 + 0;
  • 12 500 000 000 ÷ 2 = 6 250 000 000 + 0;
  • 6 250 000 000 ÷ 2 = 3 125 000 000 + 0;
  • 3 125 000 000 ÷ 2 = 1 562 500 000 + 0;
  • 1 562 500 000 ÷ 2 = 781 250 000 + 0;
  • 781 250 000 ÷ 2 = 390 625 000 + 0;
  • 390 625 000 ÷ 2 = 195 312 500 + 0;
  • 195 312 500 ÷ 2 = 97 656 250 + 0;
  • 97 656 250 ÷ 2 = 48 828 125 + 0;
  • 48 828 125 ÷ 2 = 24 414 062 + 1;
  • 24 414 062 ÷ 2 = 12 207 031 + 0;
  • 12 207 031 ÷ 2 = 6 103 515 + 1;
  • 6 103 515 ÷ 2 = 3 051 757 + 1;
  • 3 051 757 ÷ 2 = 1 525 878 + 1;
  • 1 525 878 ÷ 2 = 762 939 + 0;
  • 762 939 ÷ 2 = 381 469 + 1;
  • 381 469 ÷ 2 = 190 734 + 1;
  • 190 734 ÷ 2 = 95 367 + 0;
  • 95 367 ÷ 2 = 47 683 + 1;
  • 47 683 ÷ 2 = 23 841 + 1;
  • 23 841 ÷ 2 = 11 920 + 1;
  • 11 920 ÷ 2 = 5 960 + 0;
  • 5 960 ÷ 2 = 2 980 + 0;
  • 2 980 ÷ 2 = 1 490 + 0;
  • 1 490 ÷ 2 = 745 + 0;
  • 745 ÷ 2 = 372 + 1;
  • 372 ÷ 2 = 186 + 0;
  • 186 ÷ 2 = 93 + 0;
  • 93 ÷ 2 = 46 + 1;
  • 46 ÷ 2 = 23 + 0;
  • 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.


100 000 000 002(10) = 1 0111 0100 1000 0111 0110 1110 1000 0000 0010(2)


3. Determine the signed binary number bit length:

The base 2 number's actual length, in bits: 37.

A signed binary's bit length must be equal to a power of 2, as of:

21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...

The first bit (the leftmost) is reserved for the sign:

0 = positive integer number, 1 = negative integer number


The least number that is:

1) a power of 2

2) and is larger than the actual length, 37,

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 64.


4. Get the positive binary computer representation on 64 bits (8 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64:


Number 100 000 000 002(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

100 000 000 002(10) = 0000 0000 0000 0000 0000 0000 0001 0111 0100 1000 0111 0110 1110 1000 0000 0010

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

More operations on signed integer numbers:

» Signed integer number 100 000 000 001 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

» Signed integer number 100 000 000 003 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

The latest signed integer numbers (that are written in decimal system, in base ten) converted and written as signed binary numbers

Convert the base ten decimal system integer number -3,530,914,537,127,759,993, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number 1,011,111,110,010,067, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number -222,415, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number 1,017,101,610,151,012, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number -7,516,225,659, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number 25,570, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number -975,308,467, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number 6,356,724, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number -1,084,668, write it as a signed binary written in base two May 19 22:06 UTC (GMT)
Convert the base ten decimal system integer number 25,117, write it as a signed binary written in base two May 19 22:05 UTC (GMT)
All the decimal system integer numbers (written in base ten) converted and written as signed binary numbers

How to convert signed integers from decimal system to binary code system

Follow the steps below to convert a signed base ten integer number to signed binary:

  • 1. In a signed binary, first bit (the leftmost) is reserved for sign: 0 = positive integer number, 1 = positive integer number. If the number to be converted is negative, start with its positive version.
  • 2. Divide repeatedly by 2 the positive integer number keeping track of each remainder. STOP when we get a quotient that is ZERO.
  • 3. Construct the base 2 representation of the positive 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).
  • 4. Binary numbers represented in computer language have a length of 4, 8, 16, 32, 64, ... bits (power of 2) - if needed, fill in extra '0' bits in front of the base 2 number (to the left), up to the right length; this way the first bit (the leftmost one) is always '0', as for a positive representation.
  • 5. To get the negative reprezentation of the number, simply switch the first bit (the leftmost one), from '0' to '1'.

Example: convert the negative number -63 from decimal system (base ten) to signed binary code system:

  • 1. Start with the positive version of the number: |-63| = 63;
  • 2. Divide repeatedly 63 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder
    • 63 ÷ 2 = 31 + 1
    • 31 ÷ 2 = 15 + 1
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 3 ÷ 2 = 1 + 1
    • 1 ÷ 2 = 0 + 1
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:
    63(10) = 11 1111(2)
  • 4. The actual length of base 2 representation number is 6, so the positive binary computer representation length of the signed binary will take in this case 8 bits (the least power of 2 higher than 6) - add extra '0's in front (to the left), up to the required length; this way the first bit (the leftmost one) is to be '0', as for a positive number:
    63(10) = 0011 1111(2)
  • 5. To get the negative integer number representation simply change the first bit (the leftmost), from '0' to '1':
    -63(10) = 1011 1111
  • Number -63(10), signed integer, converted from decimal system (base 10) to signed binary = 1011 1111