What is the decimal number system?
The decimal number system, also known as the base-10 system, is the numerical system most commonly used in everyday life. It is composed of ten digits ranging from 0 to 9, where each digit’s position signifies a power of 10. The decimal system is positional, meaning the place of each digit determines its value. For example:
957 = (9 × 10²) + (5 × 10¹) + (7 × 10⁰) = 900 + 50 + 7 = 957
This positional principle allows any number—no matter how large—to be represented using these ten digits.
Humans naturally gravitated toward the decimal system because we have ten fingers, which made it intuitive for counting and arithmetic thousands of years ago. Ancient civilizations, including the Egyptians and the Hindus, structured their counting systems around this base.
What is the binary number system?
The binary number system, in contrast, is a base-2 numeral system that uses only two digits: 0 and 1. These digits are known as bits—short for “binary digits.” Each position in a binary number represents a power of 2, just as each position in a decimal number represents a power of 10. For example:
1011₂ = (1 × 2³) + (0 × 2²) + (1 × 2¹) + (1 × 2⁰)
= 8 + 0 + 2 + 1 = 11₁₀
The binary system is fundamental in computing and electronics because digital systems use two states—on (1) and off (0)—to store and process data.
Formula
Converting from decimal (base 10) to binary (base 2) can be done using successive division by 2. The steps are as follows:
- Divide the decimal number by 2.
- Record the remainder (0 or 1).
- Divide the quotient by 2 again.
- Continue until the quotient becomes 0.
- The binary representation is formed by reading the remainders from bottom to top.
Mathematically, the process can be expressed as:
If
Then, converting to binary gives:
where each .
Step-by-step examples
Example 1: Convert 89₁₀ to binary
| Operation | Quotient | Remainder |
|---|---|---|
| 89 ÷ 2 | 44 | 1 |
| 44 ÷ 2 | 22 | 0 |
| 22 ÷ 2 | 11 | 0 |
| 11 ÷ 2 | 5 | 1 |
| 5 ÷ 2 | 2 | 1 |
| 2 ÷ 2 | 1 | 0 |
| 1 ÷ 2 | 0 | 1 |
Reading remainders from bottom to top:
89₁₀ = 1011001₂
Verification:
Example 2: Convert decimal number 16 to binary
| Operation | Quotient | Remainder |
|---|---|---|
| 16 ÷ 2 | 8 | 0 |
| 8 ÷ 2 | 4 | 0 |
| 4 ÷ 2 | 2 | 0 |
| 2 ÷ 2 | 1 | 0 |
| 1 ÷ 2 | 0 | 1 |
Reading bottom to top:
16₁₀ = 10000₂
Verification:
Historical Background
The binary system has ancient roots. The earliest documentation of a binary-like system is attributed to the Chinese text I Ching (“Book of Changes”), which used divination patterns resembling binary combinations around 1000 BCE.
However, the formal foundation of modern binary arithmetic was established by Gottfried Wilhelm Leibniz in 1703. He recognized that binary could represent all numbers using only the digits 0 and 1, creating a universal system that echoes the simple duality found in nature—light and darkness, yes and no, on and off.
Centuries later, in the mid-20th century, digital computers adopted binary logic as the cornerstone of machine computation. The two states of an electrical circuit—high voltage (1) and low voltage (0)—perfectly suited binary representation, enabling complex data processing, arithmetic operations, and memory storage.
Conversion tips and notes
- Always remember to read the remainders from bottom to top after division.
- The maximum binary digit value is 1.
- For smaller numbers, binary equivalents can often be memorized:
- 1₁₀ = 1₂
- 2₁₀ = 10₂
- 4₁₀ = 100₂
- 8₁₀ = 1000₂
- 16₁₀ = 10000₂
- Binary numbers increase in powers of 2. Notice how each new bit doubles the possible numeric range.
- The reverse process (binary to decimal) involves multiplying each bit by its positional power of 2 and adding them together.
Frequently Asked Questions
How to convert 2020 to binary step by step?
| Operation | Quotient | Remainder |
|---|---|---|
| 2020 ÷ 2 | 1010 | 0 |
| 1010 ÷ 2 | 505 | 0 |
| 505 ÷ 2 | 252 | 1 |
| 252 ÷ 2 | 126 | 0 |
| 126 ÷ 2 | 63 | 0 |
| 63 ÷ 2 | 31 | 1 |
| 31 ÷ 2 | 15 | 1 |
| 15 ÷ 2 | 7 | 1 |
| 7 ÷ 2 | 3 | 1 |
| 3 ÷ 2 | 1 | 1 |
| 1 ÷ 2 | 0 | 1 |
Reading bottom to top: 11111100100₂
How to quickly check the correctness of a binary number?
To verify, expand each binary digit multiplied by its positional power of 2 and sum the results.
For example, check 10011₂:
.
Thus, 10011₂ = 19₁₀.
How to perform mental conversions for small numbers?
Practice memorizing binary representations up to 16.
Each added digit doubles the previous value:
1=1₂, 2=10₂, 3=11₂, 4=100₂, 5=101₂, 6=110₂, 7=111₂, 8=1000₂, etc.
This mental pattern helps estimations without full division.
199 from decimal to binary
| Operation | Quotient | Remainder |
|---|---|---|
| 199 ÷ 2 | 99 | 1 |
| 99 ÷ 2 | 49 | 1 |
| 49 ÷ 2 | 24 | 1 |
| 24 ÷ 2 | 12 | 0 |
| 12 ÷ 2 | 6 | 0 |
| 6 ÷ 2 | 3 | 0 |
| 3 ÷ 2 | 1 | 1 |
| 1 ÷ 2 | 0 | 1 |
Reading bottom to top: 11000111₂