Base and place value systems

Why does the digit "2" mean two hundred in $234$ but only two in $342$ ? The same symbol, in a different spot, stands for a different amount. That single fact — a digit's value depends on its place — is the quiet engine behind every number you have ever written. Only ten symbols, $0$ through $9$ , and yet they can name a number as small as $1$ or as large as a trillion, simply by reusing those ten symbols in new positions. This article unpacks two linked ideas: base, the count of distinct symbols a system allows before it must move to a new place, and place value, the rule that turns position into meaning. Along the way you will see why zero is not "just another digit" but the placeholder that keeps the whole scheme from collapsing, and why the same logic that runs decimal numbers can build a working number system in any base at all.

The core insight

A place-value system represents any number using only $b$ symbols by letting each digit's position stand for a power of the base $b$ , so a numeral's value is the sum of digit times place value across every position.

The core idea

Base (also called radix) is the count of distinct digit-symbols a system uses, and it fixes the moment a new place is needed. Decimal is base $10$ : it uses the ten symbols $0$ – $9$ , and once a count of "ones" reaches ten, there is no eleventh symbol — instead, a new "tens" place opens up. A base- $b$ system works the same way with only $b$ symbols, usually written $0$ through $b-1$ .

Place value is the rule that the same digit means different amounts depending on where it sits in the numeral. Reading a decimal numeral from right to left, the positions are worth $1, 10, 100, 1000, \dots$ — successive powers of the base. In general, for a base- $b$ numeral with digits $d_n d_{n-1}\cdots d_1 d_0$ (read left to right, most significant digit first):

N = d_n\times b^n + d_{n-1}\times b^{n-1} + \cdots + d_1\times b^1 + d_0\times b^0

where: $N$ is the number's value, $b$ is the base, $d_i$ is the digit occupying position $i$ (counted from the right, starting at $0$ ), and each $d_i$ satisfies $0 \le d_i \le b-1$ — no digit is ever allowed to reach or exceed the base itself. Setting $b = 10$ recovers the familiar decimal expansion, e.g. $234 = 2\times10^2 + 3\times10^1 + 4\times10^0$ . This one idea explains why place-value systems beat additive systems like Roman numerals: a fixed handful of symbols, reused across positions, can name any whole number, however large, without ever inventing a new symbol.

Why zero matters. Without a symbol meaning "nothing occupies this place," the scheme breaks: there would be no way to tell $23$ from $203$ or $230$ apart just by writing digits. Zero is not a quantity being counted here so much as a placeholder — it keeps every position's meaning unambiguous even when that position is empty. This is why the historical invention of a zero symbol was the missing piece that made place value fully work.

Figure

Two number lines of stacked place value blocks, one showing decimal places worth one ten hundred thousand and one showing base five places worth one five twenty five one hundred twenty five, with matching digit boxes above each block

Derivation AWhy digit times place value adds up to the whole number

The goal is to show, using nothing more than grouping objects into bundles, that writing a number as digits in positions is exactly the same as counting how many bundles of each size you have, so the formula $N = d_n b^n + \cdots + d_1 b + d_0$ is not a rule to memorise but a direct consequence of how bundling into groups of $b$ naturally works, whatever base $b$ is chosen.

Step 1. Suppose you have a pile of $N$ identical objects and you decide to bundle them in groups of $b$ . First form as many single bundles of $b$ objects as you can; the count of leftover single objects that cannot form another bundle is the ones-digit $d_0$ , and by definition $0 \le d_0 \le b-1$ (if there were $b$ or more left over, you could make one more bundle).

Step 2. Now look at the bundles themselves. Group those bundles into "super-bundles" of $b$ bundles each — each super-bundle therefore holds $b\times b = b^2$ original objects. The number of leftover single bundles (not enough to form a super-bundle) is the digit $d_1$ , again satisfying $0 \le d_1 \le b-1$ , and it represents $d_1 \times b$ objects.

Step 3. Repeat the same bundling one level higher: group super-bundles into groups of $b$ to form bundles worth $b^3$ objects each, giving digit $d_2$ worth $d_2\times b^2$ objects, and so on. At every stage, the leftover count at that level is forced to be less than $b$ , because anything reaching $b$ would already have been folded into the next bundle up — this is exactly why no digit can equal or exceed the base.

Step 4. Add up what each level of bundling contributed: the ones left over ( $d_0\times b^0$ ), plus the single bundles left over ( $d_1\times b^1$ ), plus the leftover super-bundles ( $d_2\times b^2$ ), and so on up to the largest bundle size used, $d_n\times b^n$ . Since every one of the original $N$ objects was placed into exactly one of these levels during the bundling process, the total must be their sum, giving $N = d_n\times b^n + \cdots + d_1\times b^1 + d_0\times b^0$ — the place-value formula falls straight out of repeated grouping by $b$ , for any base $b$ , not only ten.

Worked example

Problem. Using the toy base-5 system from the syllabus activity (digits $0$ through $4$ only), a number is written as $2\,1\,3\,4$ (left to right, most significant place first). Find its value in base-10, and then check the result by expanding the familiar decimal number $5{,}706$ the same way.

Step 1. Since the base is $5$ , the place values from the right are powers of $5$ : ones $=5^0=1$ , fives $=5^1=5$ , twenty-fives $=5^2=25$ , hundred-twenty-fives $=5^3=125$ .

Step 2. Match each digit of $2\,1\,3\,4$ to its place: the leftmost digit $2$ sits in the $5^3$ place, then $1$ in the $5^2$ place, then $3$ in the $5^1$ place, then the rightmost digit $4$ in the $5^0$ place.

Step 3. Multiply each digit by its place value and add: $2\times125 = 250$ ; $\;1\times25 = 25$ ; $\;3\times5=15$ ; $\;4\times1=4$ . Sum: $250+25+15+4 = 294$ .

Step 4. Check the same method on the decimal number $5706$ : place values are $10^3, 10^2, 10^1, 10^0$ , so $5706 = 5\times1000 + 7\times100 + 0\times10 + 6\times1 = 5000+700+0+6 = 5706$ — the zero in the tens place is essential, since dropping it would give $576$ , a different number entirely.

Result. The base-5 toy numeral $2134$ equals 294 in base-10, and the decimal check confirms $5706$ expands correctly with its placeholder zero intact — the identical digit-times-place-value method works for any base.

Competitive stretch

If the same base-5 digits $2\,1\,3\,4$ were instead misread as base-6 digits, the value would change to $2\times216+1\times36+3\times6+4\times1 = 432+36+18+4=490$ — a reminder that a numeral's value is meaningless without knowing its base.

Common traps

Believing base $10$ is mathematically special rather than a human/historical choice (likely tied to counting on fingers); any base can support a fully working place-value system.
Forgetting that a base- $b$ system's digits only run from $0$ to $b-1$ — base $5$ never uses a " $5$ " digit, exactly as base $10$ never uses a " $10$ " digit; it simply opens a new place instead.
Confusing "more digits" with "larger value" — length alone is not enough; compare digit by digit starting from the highest place.
Treating zero as an ordinary counted digit rather than recognising its role as the placeholder that keeps every other digit's place value unambiguous.

Ask the tutor: Try designing your own base-7 or base-12 toy number system and ask the tutor to check your place-value expansions.

Why does decimal use base 10 instead of some other base

There is no deep mathematical reason — base $10$ became standard mainly because humans have ten fingers to count on, making it a natural historical choice. Mathematically, a place-value system works equally well with any base $b \ge 2$ : binary (base $2$ ), used inside computers, and the base- $5$ or base- $12$ toy systems built in class all follow the identical rule that a digit's value is digit times a power of the base. Base $10$ is convenient and familiar, not uniquely correct.

How is a place-value system different from Roman numerals

Roman numerals are an additive system: each symbol (I, V, X, L, C, ...) has a fixed value wherever it appears, so representing large numbers needs more and more distinct symbols, and there is no zero or place value at all. A place-value system instead reuses a small, fixed set of symbols ( $0$ through $b-1$ ) and lets position multiply their meaning by powers of the base, so the same few digits can represent numbers of any size — this is why place-value systems became the standard for arithmetic.

If I am given a number in a toy base-b system, how do I find its base-10 value

Write down the place values from the right as $b^0, b^1, b^2, \dots$ , matching the base you were given. Multiply each digit by its place value, starting from the rightmost digit, and add all the products together. For example, in base 5 the numeral $324$ gives $3\times25 + 2\times5 + 4\times1 = 75+10+4 = 89$ . The method is always digit times place value, summed — only the base itself changes.

Base and place value systems

The core idea

Worked example

Competitive stretch

Common traps

Before this

Where this leads