Convert -110 110 101 150 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number -110 110 101 150(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
-110 110 101 150 to a signed binary in two's (2's) complement representation?

  • A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.

1. Start with the positive version of the number:

|-110 110 101 150| = 110 110 101 150

2. 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;
  • 110 110 101 150 ÷ 2 = 55 055 050 575 + 0;
  • 55 055 050 575 ÷ 2 = 27 527 525 287 + 1;
  • 27 527 525 287 ÷ 2 = 13 763 762 643 + 1;
  • 13 763 762 643 ÷ 2 = 6 881 881 321 + 1;
  • 6 881 881 321 ÷ 2 = 3 440 940 660 + 1;
  • 3 440 940 660 ÷ 2 = 1 720 470 330 + 0;
  • 1 720 470 330 ÷ 2 = 860 235 165 + 0;
  • 860 235 165 ÷ 2 = 430 117 582 + 1;
  • 430 117 582 ÷ 2 = 215 058 791 + 0;
  • 215 058 791 ÷ 2 = 107 529 395 + 1;
  • 107 529 395 ÷ 2 = 53 764 697 + 1;
  • 53 764 697 ÷ 2 = 26 882 348 + 1;
  • 26 882 348 ÷ 2 = 13 441 174 + 0;
  • 13 441 174 ÷ 2 = 6 720 587 + 0;
  • 6 720 587 ÷ 2 = 3 360 293 + 1;
  • 3 360 293 ÷ 2 = 1 680 146 + 1;
  • 1 680 146 ÷ 2 = 840 073 + 0;
  • 840 073 ÷ 2 = 420 036 + 1;
  • 420 036 ÷ 2 = 210 018 + 0;
  • 210 018 ÷ 2 = 105 009 + 0;
  • 105 009 ÷ 2 = 52 504 + 1;
  • 52 504 ÷ 2 = 26 252 + 0;
  • 26 252 ÷ 2 = 13 126 + 0;
  • 13 126 ÷ 2 = 6 563 + 0;
  • 6 563 ÷ 2 = 3 281 + 1;
  • 3 281 ÷ 2 = 1 640 + 1;
  • 1 640 ÷ 2 = 820 + 0;
  • 820 ÷ 2 = 410 + 0;
  • 410 ÷ 2 = 205 + 0;
  • 205 ÷ 2 = 102 + 1;
  • 102 ÷ 2 = 51 + 0;
  • 51 ÷ 2 = 25 + 1;
  • 25 ÷ 2 = 12 + 1;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

110 110 101 150(10) = 1 1001 1010 0011 0001 0010 1100 1110 1001 1110(2)

4. 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) 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, 37,

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

=== is: 64.


5. 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.


110 110 101 150(10) = 0000 0000 0000 0000 0000 0000 0001 1001 1010 0011 0001 0010 1100 1110 1001 1110

6. Get the negative integer number representation. Part 1:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in one's complement representation, replace all the bits on 0 with 1s and all the bits set on 1 with 0s.

Reverse the digits, flip the digits:

Replace the bits set on 0 with 1s and the bits set on 1 with 0s.

!(0000 0000 0000 0000 0000 0000 0001 1001 1010 0011 0001 0010 1100 1110 1001 1110)

= 1111 1111 1111 1111 1111 1111 1110 0110 0101 1100 1110 1101 0011 0001 0110 0001


7. Get the negative integer number representation. Part 2:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in two's complement representation, add 1 to the number calculated above 1111 1111 1111 1111 1111 1111 1110 0110 0101 1100 1110 1101 0011 0001 0110 0001 (to the signed binary in one's complement representation).

Binary addition carries on a value of 2:

  • 0 + 0 = 0
  • 0 + 1 = 1
  • 1 + 1 = 10
  • 1 + 10 = 11
  • 1 + 11 = 100

Add 1 to the number calculated above
(to the signed binary number in one's complement representation):

-110 110 101 150 =

1111 1111 1111 1111 1111 1111 1110 0110 0101 1100 1110 1101 0011 0001 0110 0001 + 1


Decimal Number -110 110 101 150(10) converted to signed binary in two's complement representation:

-110 110 101 150(10) = 1111 1111 1111 1111 1111 1111 1110 0110 0101 1100 1110 1101 0011 0001 0110 0010

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

Share

» More ops: Convert decimal -110 110 101 148 to signed binary in two's (2's) complement representation

» Calculations Performed by Our Visitors: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Data organized on a Monthly Basis

» Month 06, 2026 [June]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: June - by our visitors

» Improve your social skills: The Hidden Requirement in Every Single Job Description. NotebookLM YouTube Video of 8.15 minutes

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