Two's Complement: Integer ↗ Binary: 1 111 110 015 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 1 111 110 015(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;
  • 1 111 110 015 ÷ 2 = 555 555 007 + 1;
  • 555 555 007 ÷ 2 = 277 777 503 + 1;
  • 277 777 503 ÷ 2 = 138 888 751 + 1;
  • 138 888 751 ÷ 2 = 69 444 375 + 1;
  • 69 444 375 ÷ 2 = 34 722 187 + 1;
  • 34 722 187 ÷ 2 = 17 361 093 + 1;
  • 17 361 093 ÷ 2 = 8 680 546 + 1;
  • 8 680 546 ÷ 2 = 4 340 273 + 0;
  • 4 340 273 ÷ 2 = 2 170 136 + 1;
  • 2 170 136 ÷ 2 = 1 085 068 + 0;
  • 1 085 068 ÷ 2 = 542 534 + 0;
  • 542 534 ÷ 2 = 271 267 + 0;
  • 271 267 ÷ 2 = 135 633 + 1;
  • 135 633 ÷ 2 = 67 816 + 1;
  • 67 816 ÷ 2 = 33 908 + 0;
  • 33 908 ÷ 2 = 16 954 + 0;
  • 16 954 ÷ 2 = 8 477 + 0;
  • 8 477 ÷ 2 = 4 238 + 1;
  • 4 238 ÷ 2 = 2 119 + 0;
  • 2 119 ÷ 2 = 1 059 + 1;
  • 1 059 ÷ 2 = 529 + 1;
  • 529 ÷ 2 = 264 + 1;
  • 264 ÷ 2 = 132 + 0;
  • 132 ÷ 2 = 66 + 0;
  • 66 ÷ 2 = 33 + 0;
  • 33 ÷ 2 = 16 + 1;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 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.


1 111 110 015(10) = 100 0010 0011 1010 0011 0001 0111 1111(2)


3. Determine the signed binary number bit length:

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

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

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

=== is: 32.


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

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


Number 1 111 110 015(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:

1 111 110 015(10) = 0100 0010 0011 1010 0011 0001 0111 1111

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 1 111 110 014 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 1 111 110 016 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 4,202,111 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number 582,005 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number 2,341,652 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number 10,101,011,009,992 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number -52,725,317 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number 111,010,050 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number -73 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number -101,593,666 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:28 UTC (GMT)
Convert and write the signed integer number -1,064 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:27 UTC (GMT)
Convert and write the signed integer number -170 from the decimal system (base 10) to a signed binary in two's complement representation Apr 20 11:27 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