Twos Complement Calculator - Flip Bits, Add 1, Read the Signed Value

A twos complement calculator takes a non-negative integer, applies the encoding modern CPUs use for signed binary numbers, and returns the bit pattern the hardware stores along with the signed decimal value the CPU will read back.

• • Reading the negative form of a binary number: Enter a positive decimal value and immediately see the bit pattern that stands in for the negative version in twos complement.
• • Converting a binary string to its twos complement: Paste a bit string from a register dump or a textbook exercise and read back the encoded negative value without manual flipping.
• • Working through a computer science homework set: Confirm a worked example from a class on signed binary representations without writing out 1s and 0s by hand.
• • Checking the signed range for a chosen bit width: Switch from 8 bits to 16 or 32 bits to see how the signed range of a twos complement value changes with the width.

Twos complement is the dominant signed binary encoding because it lets the CPU reuse ordinary binary addition for subtraction and gives the encoding a single zero. The most significant bit flags the sign, but the negative form is not a simple bitwise NOT of every position.

Type a value, pick a bit width, and the result panel shows the padded binary representation, the twos complement bit pattern, the signed decimal value, and the sign bit.

When the input arrives as a decimal value and you need it in binary, octal, or hexadecimal, the binary converter handles the same base conversions without the signed interpretation.

The calculator reads the input as an unsigned integer, subtracts it from 2^width, and reduces the result modulo 2^width. The resulting bit pattern is the twos complement, and reading it as a signed integer gives the negative equivalent of the input.

• n: Unsigned integer value of the input, in decimal or read from a binary string. Must be in the range 0 to 2^width − 1.
• width: Number of bits in the representation. The calculator accepts 4, 8, 12, 16, 32, and 64 bits.
• range: Equal to 2^width. Subtracting n from the range and taking the result modulo range wraps overflow back into the bit width.
• twos complement: The resulting bit pattern after the modular step, padded with leading zeros to the chosen bit width.

The modular step (2^width − n) mod 2^width is equivalent to inverting every bit and adding 1, but the subtraction form runs in a single BigInt step and avoids intermediate overflow in narrow bit widths. The CPU does the same with a NOT followed by an increment.

According to Wikipedia - Two's complement, the twos complement of an n-bit number is obtained by inverting all of its bits and adding 1, and the signed range for an n-bit representation runs from −2^(n−1) to 2^(n−1) − 1.

The flip and add-one behind this tool are part of the bitwise toolkit that the binary operations calculator exposes, alongside AND, OR, XOR, and shift operations on the same two-operand form.

These four ideas cover the encoding, why the range is asymmetric, and how twos complement compares to its older ones complement counterpart.

The encoding is simple to compute but the consequences show up everywhere. The sign bit drives the signed decimal value, the modular step ensures the most negative value complements to itself, and the absence of a negative zero means binary addition can represent subtraction without a special case.

For the related question of how the encoding behaves under subtraction, the binary subtraction calculator walks through the twos complement rule that most CPUs actually use in hardware.

Pick a mode, choose a bit width, and type a value. The result panel updates as you change any field.

1. 1 Pick the input mode: Choose Decimal integer when you have a base-10 value or Binary string when you are pasting a register dump or a bit string from a homework set.
2. 2 Choose a bit width: Pick 4, 8, 12, 16, 32, or 64 bits. The signed range label updates to match, so you know which values fit before you type them.
3. 3 Enter the value: Type a non-negative integer for decimal mode or a string of 0s and 1s for binary mode. The binary input must not exceed the chosen bit width.
4. 4 Read the binary representation: Confirm the padded binary string in the result panel. The number of digits equals the chosen bit width, with leading zeros added on the left when the value is short.
5. 5 Read the twos complement: The complement row shows the encoded bit pattern after the (2^width − n) mod 2^width step. The most significant bit of this row is the sign bit the encoding uses.
6. 6 Read the signed value: Use the signed decimal value to confirm the negative equivalent. If the sign bit is 1, the signed value is negative and the magnitude is recovered by subtracting the pattern from 2^width.

Type 87 in decimal mode with 8 bits selected. The result panel shows binary 01010111, twos complement 10101001, signed value -87, and sign bit 1.

Once the twos complement is in hand and you need the sum of two such values, the binary addition calculator handles the column-by-column addition with carry that the encoding requires.

The flip-and-add recipe is two steps, and the bookkeeping around it is the part that costs time. The twos complement calculator removes that bookkeeping.

• • Avoids manual bit flipping and add-one errors: Transcribing a long binary string, flipping each bit, and adding 1 by hand is the classic place to lose a digit. The calculator runs the modular step in a single BigInt operation.
• • Computes the signed value automatically: Reading the complement as a signed integer is a step the calculator does for you, including the most-negative-value case.
• • Handles every common bit width: Switching between 8, 12, 16, 32, and 64 bits updates the signed range label, the validation, and the binary string length in the same view.
• • Accepts both decimal and binary entry: Decimal mode fits textbook numbers, binary mode fits register dumps, and the result panel keeps the two views consistent.
• • Surfaces the sign bit as a separate field: The sign bit row makes it clear whether the complement should be read as non-negative or negative, which is the most common question in a signed binary exercise.

Use the calculator while working through a signed representations chapter, or keep it open while reading a CPU manual that describes how the arithmetic logic unit negates a value.

When the bit pattern is easier to read as base-16, the binary to hexadecimal calculator groups the binary digits into nibbles and renders the matching hex string.

A handful of inputs change the result the calculator returns, and the limitations below cover the assumptions the encoding itself makes.

• • The most negative value in a twos complement system complements to itself. In 8 bits, 10000000 represents −128 and is the only negative value whose twos complement is the same pattern, a consequence of the modular arithmetic the encoding uses.
• • The calculator accepts bit widths from 4 to 64. Widths outside that range are not common in modern CPUs and are not supported, so users with a custom width should pad or truncate the result manually.
• • The calculator only computes the twos complement of a single value. Adding or subtracting two such values should be done with a binary addition or subtraction calculator, since the encoding only describes the representation.

The bit width is the only knob the user has to choose. The signed range and the validation both come from it, so changing the bit width is the first thing to try when a value does not fit.

According to Wikipedia - Signed number representations, twos complement is the dominant signed binary encoding used by modern general-purpose CPUs because it lets the same adder circuit handle both signed and unsigned values and gives the encoding a single zero.

If the wider context is hexadecimal arithmetic instead of pure binary, the hex calculator moves between hex, decimal, and binary in a single form.