Two's Complement: Integer ↗ Binary: -982 274 422 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 -982 274 422(10) converted and written as a signed binary in two's complement representation (base 2) = ?

1. Start with the positive version of the number:

|-982 274 422| = 982 274 422

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;
  • 982 274 422 ÷ 2 = 491 137 211 + 0;
  • 491 137 211 ÷ 2 = 245 568 605 + 1;
  • 245 568 605 ÷ 2 = 122 784 302 + 1;
  • 122 784 302 ÷ 2 = 61 392 151 + 0;
  • 61 392 151 ÷ 2 = 30 696 075 + 1;
  • 30 696 075 ÷ 2 = 15 348 037 + 1;
  • 15 348 037 ÷ 2 = 7 674 018 + 1;
  • 7 674 018 ÷ 2 = 3 837 009 + 0;
  • 3 837 009 ÷ 2 = 1 918 504 + 1;
  • 1 918 504 ÷ 2 = 959 252 + 0;
  • 959 252 ÷ 2 = 479 626 + 0;
  • 479 626 ÷ 2 = 239 813 + 0;
  • 239 813 ÷ 2 = 119 906 + 1;
  • 119 906 ÷ 2 = 59 953 + 0;
  • 59 953 ÷ 2 = 29 976 + 1;
  • 29 976 ÷ 2 = 14 988 + 0;
  • 14 988 ÷ 2 = 7 494 + 0;
  • 7 494 ÷ 2 = 3 747 + 0;
  • 3 747 ÷ 2 = 1 873 + 1;
  • 1 873 ÷ 2 = 936 + 1;
  • 936 ÷ 2 = 468 + 0;
  • 468 ÷ 2 = 234 + 0;
  • 234 ÷ 2 = 117 + 0;
  • 117 ÷ 2 = 58 + 1;
  • 58 ÷ 2 = 29 + 0;
  • 29 ÷ 2 = 14 + 1;
  • 14 ÷ 2 = 7 + 0;
  • 7 ÷ 2 = 3 + 1;
  • 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.


982 274 422(10) = 11 1010 1000 1100 0101 0001 0111 0110(2)


4. Determine the signed binary number bit length:

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

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

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

=== is: 32.


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


982 274 422(10) = 0011 1010 1000 1100 0101 0001 0111 0110


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

To write the negative integer number on 32 bits (4 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.

!(0011 1010 1000 1100 0101 0001 0111 0110)

= 1100 0101 0111 0011 1010 1110 1000 1001


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

To write the negative integer number on 32 bits (4 Bytes),

as a signed binary in two's complement representation,

add 1 to the number calculated above

1100 0101 0111 0011 1010 1110 1000 1001

(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):

-982 274 422 =

1100 0101 0111 0011 1010 1110 1000 1001 + 1


Number -982 274 422(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:

-982 274 422(10) = 1100 0101 0111 0011 1010 1110 1000 1010

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 -982 274 423 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 -982 274 421 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 255,127 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:02 UTC (GMT)
Convert and write the signed integer number 11,011,110,110,087 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:02 UTC (GMT)
Convert and write the signed integer number 743,676,193 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:01 UTC (GMT)
Convert and write the signed integer number 313 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:01 UTC (GMT)
Convert and write the signed integer number -452,003,696 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:00 UTC (GMT)
Convert and write the signed integer number 3,432,627 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:00 UTC (GMT)
Convert and write the signed integer number 790,473 from the decimal system (base 10) to a signed binary in two's complement representation May 19 00:00 UTC (GMT)
Convert and write the signed integer number -650,370,390 from the decimal system (base 10) to a signed binary in two's complement representation May 18 23:59 UTC (GMT)
Convert and write the signed integer number 1,011,111,111,111,009 from the decimal system (base 10) to a signed binary in two's complement representation May 18 23:59 UTC (GMT)
Convert and write the signed integer number 6,421 from the decimal system (base 10) to a signed binary in two's complement representation May 18 23:58 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