One's Complement Calculator

Compute the one's complement of any non-negative integer by flipping all bits in its binary representation for a given bit width.

FreeInstant resultsNo signup

One's Complement (Decimal)--

Formula & Methodology

Understanding One's Complement: Formula, Derivation, and Applications

One's complement is a fundamental concept in computer arithmetic used to represent signed integers in binary number systems. The one's complement of a binary number is obtained by inverting (flipping) every bit — changing each 0 to 1 and each 1 to 0. This operation plays a critical role in digital logic design, networking protocols, and historical computing architectures.

The One's Complement Formula

The mathematical formula for computing the one's complement of a non-negative decimal integer N with a given bit width W is:

One's Complement = (2^W − 1) − N

Where:

N — The non-negative decimal integer whose one's complement is being computed. This value must satisfy 0 ≤ N ≤ 2^W − 1.
W — The bit width, representing the number of bits in the binary representation (commonly 4, 8, 16, or 32).
2^W − 1 — A binary number consisting entirely of 1s for the given bit width. For example, with W = 8, this value equals 255 (binary: 11111111).

Why the Formula Works

The expression 2^W − 1 produces a binary number where every bit is set to 1. Subtracting N from this value is algebraically equivalent to flipping each bit of N's binary representation. Consider an 8-bit example: 2⁸ − 1 = 255 = 11111111 in binary. Subtracting any 8-bit binary number from 11111111 inverts every bit, because 1 − 0 = 1 and 1 − 1 = 0 at each bit position. This bitwise inversion is precisely the definition of one's complement (Academia.edu — One's Complement and Two's Complement).

Step-by-Step Calculation Example

To find the one's complement of the decimal number 83 using an 8-bit representation:

Step 1: Convert 83 to binary → 01010011
Step 2: Calculate 2⁸ − 1 = 255
Step 3: Subtract: 255 − 83 = 172
Step 4: Verify by converting 172 to binary → 10101100
Step 5: Confirm that 01010011 and 10101100 are bitwise inverses of each other ✓

Each bit in the original number has been flipped, confirming the result.

One's Complement in Signed Number Representation

In one's complement signed representation, the most significant bit (MSB) serves as the sign bit: 0 for positive and 1 for negative. To represent a negative number, take the one's complement of the corresponding positive value. For example, in an 8-bit system, +5 is represented as 00000101, and −5 is represented as 11111010 (the one's complement of 00000101).

This system has a notable characteristic: two representations of zero exist — positive zero (00000000) and negative zero (11111111). The range of representable values in an N-bit one's complement system spans from −(2^N−1 − 1) to +(2^N−1 − 1). For 8 bits, that range is −127 to +127 (Plantz, R. G. — Computer Arithmetic, Chapter 3).

One's Complement vs. Two's Complement

Most modern processors use two's complement rather than one's complement for signed integer arithmetic. Two's complement eliminates the dual-zero problem by adding 1 to the one's complement result, producing a single representation of zero and a slightly wider negative range (−128 to +127 for 8 bits). However, one's complement remains significant in several domains:

Internet checksums: The Internet Protocol (IP), TCP, and UDP headers use one's complement arithmetic for error-detection checksums, as specified in RFC 1071.
Legacy systems: Early mainframes such as the UNIVAC 1100 series and the CDC 6600 used one's complement representation.
Educational foundations: Understanding one's complement is essential for grasping two's complement, as the latter is derived directly from it (two's complement = one's complement + 1).

Common Bit Width Reference Table

The following table shows the maximum value and the one's complement mask (2^W − 1) for standard bit widths:

4-bit: Mask = 15 (1111), Range: 0–15
8-bit: Mask = 255 (11111111), Range: 0–255
16-bit: Mask = 65,535 (sixteen 1s), Range: 0–65,535
32-bit: Mask = 4,294,967,295 (thirty-two 1s), Range: 0–4,294,967,295

Practical Applications

Beyond signed number representation, one's complement finds use in:

Error detection: Network protocols compute checksums by summing data words using one's complement addition and then taking the one's complement of the result.
Bitwise operations: The NOT operation in most programming languages (e.g., ~x in C, Python, and Java) performs a one's complement on the binary representation.
Digital circuit design: Inverter gates in hardware naturally produce one's complement outputs.

Frequently Asked Questions

What is the one's complement of a binary number?

The one's complement of a binary number is the value obtained by flipping every bit — each 0 becomes 1 and each 1 becomes 0. For example, the one's complement of the 8-bit binary number 01101001 (decimal 105) is 10010110 (decimal 150). Mathematically, this equals (2^W − 1) − N, where W is the bit width and N is the original number. This operation is equivalent to subtracting the number from a binary value composed entirely of 1s.

How does one's complement differ from two's complement?

One's complement flips all bits, while two's complement flips all bits and then adds 1 to the result. The key practical difference is that one's complement has two representations of zero (+0 and −0), whereas two's complement has a single zero. For 8-bit numbers, one's complement represents values from −127 to +127, while two's complement covers −128 to +127. Modern processors overwhelmingly use two's complement because it simplifies hardware design for addition and subtraction circuits.

Why is one's complement used in Internet checksums?

Internet protocols like IP, TCP, and UDP use one's complement arithmetic for checksums because of a unique advantage: the checksum is byte-order independent, meaning it produces the same result regardless of whether the system uses big-endian or little-endian byte ordering. Additionally, one's complement addition allows end-around carry, where any overflow bit wraps back and is added to the least significant bit. This property simplifies incremental checksum updates when only a few header fields change, avoiding the need to recompute the entire checksum from scratch.

What bit width should be used for one's complement calculations?

The bit width should match the data format being used. Standard choices include 4-bit (nibble), 8-bit (byte), 16-bit (short), and 32-bit (word). For general-purpose computing, 8-bit is common for single-byte values, 16-bit for network checksums, and 32-bit for standard integer operations. The chosen bit width must be large enough to represent the original number — for instance, the decimal value 200 requires at least 8 bits since it exceeds the 4-bit maximum of 15. Select the smallest standard width that accommodates the input value.

How to calculate one's complement manually without a calculator?

To calculate one's complement manually, follow these steps: First, convert the decimal number to binary with the desired bit width, padding with leading zeros if necessary. Then, flip every bit — change each 0 to 1 and each 1 to 0. For example, to find the one's complement of decimal 45 in 8 bits: convert 45 to binary (00101101), then flip each bit to get 11010010, which equals decimal 210. Verify the result by confirming that the original and complemented values sum to 2^W − 1 (in this case, 45 + 210 = 255 = 2^8 − 1).

What is the relationship between one's complement and the bitwise NOT operator?

The bitwise NOT operator (~) in programming languages like C, Java, and Python performs a one's complement operation on the binary representation of a number. For an unsigned 8-bit integer x, ~x produces the exact same result as (255 − x). However, in languages that use signed two's complement integers, ~x returns −(x + 1) rather than a simple bit flip within a fixed width. For instance, ~5 in a 32-bit signed integer yields −6, not 250. Understanding this distinction prevents common bugs when working with bitwise operations in software development.