Two's Complement: Integer ↗ Binary: 10 111 100 016 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 10 111 100 016(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;
  • 10 111 100 016 ÷ 2 = 5 055 550 008 + 0;
  • 5 055 550 008 ÷ 2 = 2 527 775 004 + 0;
  • 2 527 775 004 ÷ 2 = 1 263 887 502 + 0;
  • 1 263 887 502 ÷ 2 = 631 943 751 + 0;
  • 631 943 751 ÷ 2 = 315 971 875 + 1;
  • 315 971 875 ÷ 2 = 157 985 937 + 1;
  • 157 985 937 ÷ 2 = 78 992 968 + 1;
  • 78 992 968 ÷ 2 = 39 496 484 + 0;
  • 39 496 484 ÷ 2 = 19 748 242 + 0;
  • 19 748 242 ÷ 2 = 9 874 121 + 0;
  • 9 874 121 ÷ 2 = 4 937 060 + 1;
  • 4 937 060 ÷ 2 = 2 468 530 + 0;
  • 2 468 530 ÷ 2 = 1 234 265 + 0;
  • 1 234 265 ÷ 2 = 617 132 + 1;
  • 617 132 ÷ 2 = 308 566 + 0;
  • 308 566 ÷ 2 = 154 283 + 0;
  • 154 283 ÷ 2 = 77 141 + 1;
  • 77 141 ÷ 2 = 38 570 + 1;
  • 38 570 ÷ 2 = 19 285 + 0;
  • 19 285 ÷ 2 = 9 642 + 1;
  • 9 642 ÷ 2 = 4 821 + 0;
  • 4 821 ÷ 2 = 2 410 + 1;
  • 2 410 ÷ 2 = 1 205 + 0;
  • 1 205 ÷ 2 = 602 + 1;
  • 602 ÷ 2 = 301 + 0;
  • 301 ÷ 2 = 150 + 1;
  • 150 ÷ 2 = 75 + 0;
  • 75 ÷ 2 = 37 + 1;
  • 37 ÷ 2 = 18 + 1;
  • 18 ÷ 2 = 9 + 0;
  • 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.


10 111 100 016(10) = 10 0101 1010 1010 1011 0010 0100 0111 0000(2)


3. Determine the signed binary number bit length:

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

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, 34,

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 10 111 100 016(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:

10 111 100 016(10) = 0000 0000 0000 0000 0000 0000 0000 0010 0101 1010 1010 1011 0010 0100 0111 0000

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 10 111 100 015 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 10 111 100 017 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 -1,414,812,749 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:27 UTC (GMT)
Convert and write the signed integer number 10,101,156 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:26 UTC (GMT)
Convert and write the signed integer number -8,644,934,341,102,468,603 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:26 UTC (GMT)
Convert and write the signed integer number 567,439 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:26 UTC (GMT)
Convert and write the signed integer number 3,850,111 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:25 UTC (GMT)
Convert and write the signed integer number -5,871 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:24 UTC (GMT)
Convert and write the signed integer number -58,334 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:23 UTC (GMT)
Convert and write the signed integer number 206 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:23 UTC (GMT)
Convert and write the signed integer number -122 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:22 UTC (GMT)
Convert and write the signed integer number 485,715 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:22 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