Two's Complement Calculator (2024)

In the binary system, all numbers are a combination of two digits, $0$0 or $1$1. Each digit corresponds to a successive power of 2, starting on the right.

For example, $12$12 in binary is $1100$1100, as $12 = 8 + 4 = 1\cdot2^3 + 1\cdot2^2 + 0\cdot2^1 + 0\cdot2^0$12=8+4=1⋅23+1⋅22+0⋅21+0⋅20 (using scientific notation). The hexadecimal system is an extended version of the binary system(which uses base 16 instead of base 2). The latter is frequently used in many computer software and systems. If you want to read more, head to our decimal to hexadecimal converter.

Learning about binary leads to many natural questions: What about negative numbers in the binary system? Or how do I subtract binary numbers? As we can only use $1$1 to show that something is present or $0$0 to mean that there is a lack of that thing, there are two main approaches:

1. Two's complement representation, or, in other words, signed notation – the first bit tells about the sign. The convention is that a number with a leading $1$1 is negative, while a leading $0$0 denotes a positive value. In an 8-bit representation, we can write any number from -128 to 127. The name comes from the fact that a negative number is a two's complement of a positive one.

2. Unsigned notation – a representation that supports only positive values. Its advantage over the signed one is that, within the same 8-bit system, we can get any number from 0 up to 255.

The unsigned notation is good enough if we need to add or multiply positive numbers. But, usually, the more practical solution is to work with negative numbers as well. A useful thing about the 2's complement representation is that subtraction is equivalent to an addition of a negative number, which we can handle.

Whenever you want to convert a decimal number into a binary value in two's complement representation, follow these steps:

1. Choose the number of bits in your notation. The higher value, the broader range of numbers you can input.

2. Write any whole decimal within the range that appears under the Decimal to binary section.

3. … and that's it – the 2's complement calculator will do the rest of the work! It shows the equivalent binary number and its two's complement.

Do you want to estimate the outcome by hand? This is how two's complement calculator does it:

1. Choose the number of bits in the binaries representation. Let's assume we want values in the 8-bit system.

2. Write down your number, let's say 16. 16 in binary is $1\ 0000$10000.

3. Add some leading $0$0's so that the number has eight digits, $0001\ 0000$00010000. That's 16 in the two's complement notation.

And what about its counterpart, $-16$−16?

4. Switch all the digits to their opposite ($0\rightarrow1$0→1 and $1\rightarrow0$1→0). In our case, $0001\ 0000 \rightarrow 1110\ 1111$00010000→11101111.

5. Add 1 to this value, $1110\ 1111 + 1 = 1111\ 0000$11101111+1=11110000.

6. $1111\ 0000$11110000 in the two's complement representation is $-16$−16 in decimal notation and is the 2's complement of $0001\ 0000$00010000.

Look, as long as you are proficient in switching digits and adding unity to a binary value, evaluating negative numbers in binary is not a big deal!

🔎 In case of adding binary numbers, you may find our binary addition calculator helpful.

Our 2's complement calculator can also work the other way around – converting any two's complement to its decimal value. Let's try to convert $1011\ 1011$10111011, a signed binary, to decimal. Two useful methods help you find the outcome:

Method 1

Convert this signed binary into a decimal, like normal, but multiply the leading digit by $-1$−1 instead of $1$1. Starting from the right:

Method 2

We can see that the first digit is $1$1, so our number is negative. First, find its two's complement, then convert the value to a decimal, and come back to the original value:

1. Reverse digits, $1011\ 1011 \rightarrow 0100\ 0100$10111011→01000100.
2. Add a unity, $0100\ 0100 + 1 = 0100\ 0101$01000100+1=01000101.
3. Convert to a decimal (starting from the right),

4. $\rm{decimal} = 1 + 4 + 64 = 69$decimal=1+4+64=69.
5. As $69$69 is the absolute value of our initial (negative) binary, add a minus sign in front of it.
6. $1011\ 1011$10111011 is $-69$−69 in two's complement binary notation.

If you want to find any whole number in the two's complement eight-bit representation, you may find this table handy. You can see both the value and its two's complement in the same row.

If you are interested in working with the values of a different number of bits, just use our two's complement calculator to save yourself time and effort!

The two's complement is a way to represent negative numbers in binary when the minus sign is not available. The minus sign is substituted in the two's complement representation by a digit, usually the leading one.

• If the leading digit is 0, the number is positive.
• If the leading digit is 1, the number is negative.

To calculate the two's complement of a number:

1. If the number is negative, subtract it from the power of 2 with exponent corresponding to the number of bits of your chosen representation.
2. Convert the number to binary.
3. If the number was negative, add 1 to the proper position and pad with 0.
4. If the number was positive, left-pad the result with 0 to the desired length.

The 8-bit two's complement representation of −37 is 11011011₂. To find this result:

1. Subtract 37 from 2⁷: 128 − 37 =91.
2. Find the binary representation of 91:
   91 = 64 + 16 + 8 + 2 + 1
   = 1·2⁶ + 0·2⁵ + 1·2⁴ + 1·2³ + 0·2² + 1·2¹ + 1·2⁰
   =1011011
3. Place 1 in the correct position to mark that we started from a negative number:
   −37₁₀ = 11011011₂