Two's Complement: Integer ↗ Binary: 8 589 934 345 Convert the Integer Number to a Signed Binary in Two's Complement Representation. Write the Base Ten Decimal System Number as a Binary Code (Written in Base Two)

Signed integer number 8 589 934 345(10) converted and written as a signed binary in two's complement representation (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;
  • 8 589 934 345 ÷ 2 = 4 294 967 172 + 1;
  • 4 294 967 172 ÷ 2 = 2 147 483 586 + 0;
  • 2 147 483 586 ÷ 2 = 1 073 741 793 + 0;
  • 1 073 741 793 ÷ 2 = 536 870 896 + 1;
  • 536 870 896 ÷ 2 = 268 435 448 + 0;
  • 268 435 448 ÷ 2 = 134 217 724 + 0;
  • 134 217 724 ÷ 2 = 67 108 862 + 0;
  • 67 108 862 ÷ 2 = 33 554 431 + 0;
  • 33 554 431 ÷ 2 = 16 777 215 + 1;
  • 16 777 215 ÷ 2 = 8 388 607 + 1;
  • 8 388 607 ÷ 2 = 4 194 303 + 1;
  • 4 194 303 ÷ 2 = 2 097 151 + 1;
  • 2 097 151 ÷ 2 = 1 048 575 + 1;
  • 1 048 575 ÷ 2 = 524 287 + 1;
  • 524 287 ÷ 2 = 262 143 + 1;
  • 262 143 ÷ 2 = 131 071 + 1;
  • 131 071 ÷ 2 = 65 535 + 1;
  • 65 535 ÷ 2 = 32 767 + 1;
  • 32 767 ÷ 2 = 16 383 + 1;
  • 16 383 ÷ 2 = 8 191 + 1;
  • 8 191 ÷ 2 = 4 095 + 1;
  • 4 095 ÷ 2 = 2 047 + 1;
  • 2 047 ÷ 2 = 1 023 + 1;
  • 1 023 ÷ 2 = 511 + 1;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 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.


8 589 934 345(10) = 1 1111 1111 1111 1111 1111 1111 0000 1001(2)


3. Determine the signed binary number bit length:

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

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) indicates 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, 33,

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 8 589 934 345(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in two's complement representation:

8 589 934 345(10) = 0000 0000 0000 0000 0000 0000 0000 0001 1111 1111 1111 1111 1111 1111 0000 1001

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

More operations on integers written as signed binary numbers in two's complement representation:

» Signed integer number 8 589 934 344 converted from decimal system (from base 10) and written as a signed binary in two's complement representation (written in base 2) = ?

» Signed integer number 8 589 934 346 converted from decimal system (from base 10) and written as a signed binary in two's complement representation (written in base 2) = ?

The latest signed integer numbers written in base ten converted from decimal system to binary two's complement representation

Convert and write the signed integer number 110,100,110,065 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:08 UTC (GMT)
Convert and write the signed integer number -7,201 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:08 UTC (GMT)
Convert and write the signed integer number -93 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:08 UTC (GMT)
Convert and write the signed integer number -77 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:07 UTC (GMT)
Convert and write the signed integer number 1,000,000,110,101,196 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:07 UTC (GMT)
Convert and write the signed integer number 251 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:06 UTC (GMT)
Convert and write the signed integer number 50,000 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:06 UTC (GMT)
Convert and write the signed integer number -117 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:04 UTC (GMT)
Convert and write the signed integer number -693,714,023 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:04 UTC (GMT)
Convert and write the signed integer number -89,703,954 from the decimal system (base 10) to a signed binary in two's complement representation May 20 02:04 UTC (GMT)
All the decimal system integer numbers converted and written as signed binary numbers in two's complement representation

How to convert signed integers from decimal system to signed binary in two's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in two's complement representation:

  • 1. If the number to be converted is negative, start with the positive version of the number.
  • 2. Divide repeatedly by 2 the positive representation of the integer number, keeping track of each remainder, until 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 must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will be 0, correctly representing a positive number.
  • 5. To get the negative integer number representation in signed binary one's complement, replace all 0 bits with 1s and all 1 bits with 0s (reversing the digits).
  • 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

  • 1. Start with the positive version of the number: |-60| = 60
  • 2. Divide repeatedly 60 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 60 ÷ 2 = 30 + 0
    • 30 ÷ 2 = 15 + 0
    • 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:
    60(10) = 11 1100(2)
  • 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
    60(10) = 0011 1100(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
    !(0011 1100) = 1100 0011
  • 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
    -60(10) = 1100 0011 + 1 = 1100 0100
  • Number -60(10), signed integer, converted from decimal system (base 10) to signed binary two's complement representation = 1100 0100