Binary bits are the smallest standard units of digital information. A binary bit has two possible symbolic values, 0 and 1. When several bits are placed together, their positions carry powers-of-two values, allowing the group to represent numbers, flags, characters, and other encoded data.

The key rule is simple: one bit creates 2 possible patterns, while n bits create 2ⁿ possible patterns. The pattern count is separate from the numeric range, which depends on whether the bits are interpreted as unsigned, signed, or another data type.

Binary Bits: What Is a Bit?

A bit is a binary digit and the smallest abstract unit of information in digital computing. At the logical level, it records one of two states: 0 or 1. These symbols are convenient labels for alternatives such as off/on, false/true, or low/high.

Why 0 and 1 are symbolic, not universal voltage levels

In software and data formats, 0 and 1 describe logical states rather than literal physical voltage levels. Hardware can represent those states using different electrical, magnetic, optical, or electronic mechanisms. Even electrical systems can use different voltage ranges and signaling conventions. Therefore, a bit always has two logical alternatives, but every physical bit is not implemented with the same electrical states.

A Binary Bit Has Two Possible Values

One bit can hold either 0 or 1 at a given time. It cannot represent a third distinct binary value without adding another bit or changing the encoding system.

With two bits, the available patterns are 00, 01, 10, and 11. The order matters when the bits form a number. The rightmost position is the least significant bit, and the leftmost position is the most significant bit in the usual notation.

Bit Values in Binary Place Values

Each position in a binary number has a place value based on a power of two. Starting at the right, the values are 2⁰ = 1, 2¹ = 2, 2² = 4, 2³ = 8, and so on. A 1 includes its position’s value; a 0 contributes nothing.

Reading 1011 with powers of two

Read 1011 from left to right using the place values 8, 4, 2, and 1:

• 1 × 8 = 8
• 0 × 4 = 0
• 1 × 2 = 2
• 1 × 1 = 1

Adding the included values gives 8 + 2 + 1 = 11. The same four binary positions can produce any unsigned value from 0 through 15.

How Many Patterns Can n Bits Represent?

The number of possible patterns doubles whenever one bit is added. The formula is 2ⁿ, where n is the number of bits. For example, 3 bits provide 2³ = 8 patterns, and 8 bits provide 2⁸ = 256 patterns.

Patterns versus unsigned and signed numeric ranges

Pattern count does not by itself specify the numbers represented. For n unsigned bits, the range is 0 through 2ⁿ − 1, using all patterns for nonnegative values. Thus, four unsigned bits represent 16 patterns and the values 0–15.

A common signed format, two’s complement, uses the same 2ⁿ patterns for a range from −2ⁿ⁻¹ through 2ⁿ⁻¹ − 1. Four signed bits therefore represent −8 through 7. Other encodings can assign different meanings to the same patterns.

Bits Inside Bytes and Machine Values

A byte conventionally contains 8 bits, so it has 256 possible patterns. As an unsigned integer, a byte represents 0–255. In common two’s-complement form, it represents −128–127.

Machine values may use bits as more than whole numbers. Individual bits can act as Boolean flags, while groups of bits can encode an instruction field, character, color component, or measurement. The surrounding format determines how the bit values should be interpreted.