Two's Complement: Integer ↗ Binary: 11 001 100 110 114 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 11 001 100 110 114(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;
  • 11 001 100 110 114 ÷ 2 = 5 500 550 055 057 + 0;
  • 5 500 550 055 057 ÷ 2 = 2 750 275 027 528 + 1;
  • 2 750 275 027 528 ÷ 2 = 1 375 137 513 764 + 0;
  • 1 375 137 513 764 ÷ 2 = 687 568 756 882 + 0;
  • 687 568 756 882 ÷ 2 = 343 784 378 441 + 0;
  • 343 784 378 441 ÷ 2 = 171 892 189 220 + 1;
  • 171 892 189 220 ÷ 2 = 85 946 094 610 + 0;
  • 85 946 094 610 ÷ 2 = 42 973 047 305 + 0;
  • 42 973 047 305 ÷ 2 = 21 486 523 652 + 1;
  • 21 486 523 652 ÷ 2 = 10 743 261 826 + 0;
  • 10 743 261 826 ÷ 2 = 5 371 630 913 + 0;
  • 5 371 630 913 ÷ 2 = 2 685 815 456 + 1;
  • 2 685 815 456 ÷ 2 = 1 342 907 728 + 0;
  • 1 342 907 728 ÷ 2 = 671 453 864 + 0;
  • 671 453 864 ÷ 2 = 335 726 932 + 0;
  • 335 726 932 ÷ 2 = 167 863 466 + 0;
  • 167 863 466 ÷ 2 = 83 931 733 + 0;
  • 83 931 733 ÷ 2 = 41 965 866 + 1;
  • 41 965 866 ÷ 2 = 20 982 933 + 0;
  • 20 982 933 ÷ 2 = 10 491 466 + 1;
  • 10 491 466 ÷ 2 = 5 245 733 + 0;
  • 5 245 733 ÷ 2 = 2 622 866 + 1;
  • 2 622 866 ÷ 2 = 1 311 433 + 0;
  • 1 311 433 ÷ 2 = 655 716 + 1;
  • 655 716 ÷ 2 = 327 858 + 0;
  • 327 858 ÷ 2 = 163 929 + 0;
  • 163 929 ÷ 2 = 81 964 + 1;
  • 81 964 ÷ 2 = 40 982 + 0;
  • 40 982 ÷ 2 = 20 491 + 0;
  • 20 491 ÷ 2 = 10 245 + 1;
  • 10 245 ÷ 2 = 5 122 + 1;
  • 5 122 ÷ 2 = 2 561 + 0;
  • 2 561 ÷ 2 = 1 280 + 1;
  • 1 280 ÷ 2 = 640 + 0;
  • 640 ÷ 2 = 320 + 0;
  • 320 ÷ 2 = 160 + 0;
  • 160 ÷ 2 = 80 + 0;
  • 80 ÷ 2 = 40 + 0;
  • 40 ÷ 2 = 20 + 0;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 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.


11 001 100 110 114(10) = 1010 0000 0001 0110 0100 1010 1010 0000 1001 0010 0010(2)


3. Determine the signed binary number bit length:

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

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

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 11 001 100 110 114(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:

11 001 100 110 114(10) = 0000 0000 0000 0000 0000 1010 0000 0001 0110 0100 1010 1010 0000 1001 0010 0010

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 11 001 100 110 113 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 11 001 100 110 115 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 66,546 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:28 UTC (GMT)
Convert and write the signed integer number 100,010,011,074 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:28 UTC (GMT)
Convert and write the signed integer number 1,000,000,000,100,943 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:28 UTC (GMT)
Convert and write the signed integer number -104,755 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:28 UTC (GMT)
Convert and write the signed integer number 10,111,100,016 from the decimal system (base 10) to a signed binary in two's complement representation May 20 06:28 UTC (GMT)
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)
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