Binary Number System: Base 2 Explained with Examples
The binary number system is a base-2 positional system. It builds every number from just two digits, 0 and 1, where each digit position is worth twice the position to its right. The decimal number thirteen, for example, is written 1101 in binary. Computers use binary because two digits map perfectly onto circuits that are either on or off.
If “base-2 positional” sounds like jargon, stay with me. You already understand the concept, because decimal works the same way.
Positional systems: the idea underneath both
The number 555 uses the digit 5 three times, and each one means something different. Five hundreds. Five tens. Five ones. Same symbol, different value, purely because of where it sits.
That’s what “positional” means: position carries value. And “base” tells you the multiplier between neighboring positions. Decimal is base 10, so each step left multiplies by ten. The places are worth 1, 10, 100, 1000.
Binary is base 2. Each step left multiplies by two, so the places are worth 1, 2, 4, 8, 16, 32, 64, 128, and on it goes. With the multiplier being two, you only need two digits per place. A place either contributes its value (1) or it doesn’t (0). There’s no binary digit for “this place counts twice,” because that’s just the next place over.
Reading a binary number
Take 1101. Four digits, so four places. From right to left they’re worth 1, 2, 4, and 8.
Now add up the places holding a 1: the eights place, the fours place, and the ones place. 8 + 4 + 1 = 13.
That’s the entire skill. Any binary number, any length, same move: label the places, sum the ones that are switched on. A longer example: 10100 has a 1 in the sixteens place and a 1 in the fours place. 16 + 4 = 20.
The how to convert binary to decimal guide turns this into two step-by-step methods with more worked examples, and how to convert decimal to binary covers the return trip using repeated division. If you’d rather see the pattern than compute it, the numbers in binary table lists the first few dozen numbers side by side.
Counting and carrying
Decimal counting has a rhythm you stopped noticing in first grade: 8, 9, and then you’re out of digits, so you write 10. Reset the column, carry a one.
Binary has the same rhythm on a faster loop. You’re out of digits after 1. So counting goes: 0, 1, then carry to get 10, then 11, then carry twice to get 100. Every other number triggers a carry. It’s why binary numbers grow long so quickly; twenty already takes five digits (10100) while decimal handles it in two.
Length is the price. Reliability is what it buys, and for machines that trade is a steal.
Binary vs. decimal vs. hex vs. octal
These four systems all describe the same numbers. They differ only in base, which changes how many digits they use and how compact they are.
Decimal, base 10, is for humans. Ten digits, 0 through 9, matching our ten fingers. No machine-friendly properties whatsoever; it exists because we do.
Binary, base 2, is for circuits. Two digits. Maximum simplicity, maximum length.
Hexadecimal, base 16, is for humans reading binary. Sixteen digits: 0 through 9, then A through F, where A stands for ten and F for fifteen. The magic is that sixteen is two to the fourth power, so one hex digit corresponds to exactly four bits. A byte, eight bits, is always exactly two hex digits. Programmers see hex constantly (color codes like those in CSS are hex bytes) because it compresses binary fourfold with zero ambiguity. Try the binary to hex converter to watch four bits collapse into one digit at a time.
Octal, base 8, is the older cousin. Digits 0 through 7, one octal digit per three bits. It mattered more on early machines whose word sizes divided neatly by three, and it survives today mainly in Unix file permissions. The binary to octal converter shows the three-bit grouping in action.
The takeaway: hex and octal aren’t different data. They’re compact spellings of binary, related by clean bit groupings, which is exactly why programmers use them and why base 10 is the odd one out in computing.
Why computers settled on base 2
The short answer is engineering, not math.
A digital circuit represents a digit with a voltage. If your system needs ten distinguishable digits, you need ten distinguishable voltage bands, and the gaps between them shrink to fractions of a volt. Real components are noisy: temperature, interference, and manufacturing variation all push voltages around. Narrow bands mean misread digits, and a computer that misreads even rarely is useless.
With two states, the bands can be far apart. A signal can degrade substantially and still land clearly on the correct side. That noise immunity is what lets a processor run billions of operations per second for years without flipping a digit.
Binary also collapses arithmetic into trivial hardware. The full multiplication table for binary digits has four entries. Logic operations (AND, OR, NOT) and arithmetic become the same kind of circuit, built from the same transistors. If you want to poke at binary arithmetic directly, the binary calculator adds, subtracts, multiplies, and divides in base 2.
And there’s a conceptual bonus: 1 and 0 double as true and false. George Boole’s logic algebra, worked out in the 1800s, turned out to be a perfect fit for two-state circuits. Decision-making and number-crunching run on identical machinery.
Where you’ll actually meet binary numbers
Beyond the classroom, binary place values explain a bunch of oddly specific numbers you’ve seen for years. RGB color channels run 0 to 255 because a channel is one byte, and eight bits give 256 combinations. Old game consoles were “8-bit” or “16-bit” by how many binary digits they processed at once. IPv4 addresses are four bytes, which is why each chunk stops at 255. File sizes come in 1024s because that’s a power of two.
None of those numbers is arbitrary. They’re all binary showing through the paint.
For the broader story of how base-2 numbers came to carry text, images, and sound, read binary code, or start from the absolute beginning with what is binary.
FAQ
What is the binary number system?
It’s a base-2 positional number system that writes every number using only the digits 0 and 1. Each digit position is worth twice the position to its right, so the place values run 1, 2, 4, 8, 16, and so on. It’s the native number system of all modern computers.
How do you read a binary number?
Label each digit’s place value, starting at 1 on the right and doubling leftward. Then add up the values of the places that contain a 1. For 1101, the eights, fours, and ones places are on, and 8 + 4 + 1 = 13. Zeros contribute nothing; they hold positions open.
What is the difference between binary and decimal?
The base. Decimal uses ten digits and multiplies place value by ten at each step; binary uses two digits and multiplies by two. Both are positional systems, and both can represent any number. Binary needs more digits to say the same thing but suits two-state electronics perfectly.
Why is hexadecimal used with binary?
One hex digit represents exactly four binary digits, because sixteen is two to the fourth power. A byte becomes two hex characters instead of eight bits, which is far easier for people to read and compare. Programmers use hex as a compact, lossless shorthand for binary, not as different data.
Why don’t computers use base 10?
Circuits are reliable with two voltage states and fragile with ten. Distinguishing ten voltage levels leaves tiny margins that electrical noise can cross, causing misread digits. Two widely spaced states tolerate noise, keep hardware simple, and align with true/false logic, so base 2 wins on every engineering axis.