Pick a number, say 12. Arrange the integers 1, 2, 3, \dots, 12 evenly around a circle like the markings on a clock. Now light up only the integers that divide 12 — that is, the divisors 1, 2, 3, 4, 6, 12. What you see is not random. The lit-up points pair off across the centre, leaving a characteristic pattern. This is the factor clock, and it turns divisibility from an arithmetic test into a picture you can read at a glance.
The picture tells you three things instantly: how many divisors n has, how they pair up, and whether n is special (prime, perfect square, or highly composite). Once you see these patterns, divisor counts stop feeling like trivia and start feeling like geometry.
The clock, with n = 12
The twelve positions on the clock hold the integers 1 through 12. Six of them — 1, 2, 3, 4, 6, 12 — divide 12. Light them up. The lit positions are not spread uniformly around the circle; they cluster at the "small" end (1, 2, 3, 4), with two more at 6 and 12.
Notice the pairing: 1 \times 12 = 12, 2 \times 6 = 12, 3 \times 4 = 12. Each divisor has a partner — another divisor it multiplies with to give 12. The small divisor at one side of the pair has a large divisor on the other side. In the clock picture, if you look at each divisor d and its partner n/d, they mirror each other around \sqrt{n}.
For n = 12, \sqrt{12} \approx 3.46. The divisors 1, 2, 3 sit below this threshold and each has a partner 12, 6, 4 above the threshold. Six divisors, three pairs, no divisor equals its own partner.
Interactive factor clock
What the clock reveals
Primes look like two lonely dots. When n is prime, only two positions light up: 1 and n itself. Every other position is dim. The clock for a prime looks empty — that emptiness is what "prime" means visually.
Perfect squares have an odd number of divisors. For most n, divisors pair up: (d, n/d) with d \neq n/d. Pairs give even counts. But when n is a perfect square, one divisor is its own partner — the square root. For n = 9, the divisor 3 satisfies 3 \times 3 = 9, so 3 pairs with itself. The total divisor count becomes odd: 1, 3, 9 — three divisors.
Why: divisors pair as (d, n/d). This pairing is a two-to-one correspondence except when d = n/d, which happens exactly when d = \sqrt{n}. So the count is even unless n is a perfect square, in which case one divisor stands alone and the count is odd.
Highly composite numbers light up the most dots. A number with many divisors — like 12, 24, or 36 — has its factor clock crowded with lit positions. These are the highly composite numbers, useful in everyday life because they divide cleanly: 12 months, 24 hours, 60 minutes. Ancient Indian and Babylonian calendars are built on such numbers precisely because their clocks are full.
Square-free numbers have divisor counts that are powers of two. If n = p_1 p_2 \cdots p_k is a product of k distinct primes with no repeats, then n has exactly 2^k divisors. Every divisor corresponds to a subset of \{p_1, \dots, p_k\}. For n = 30 = 2 \times 3 \times 5, the divisors are 1, 2, 3, 5, 6, 10, 15, 30 — eight of them, matching 2^3.
The divisor count formula
If n = p_1^{a_1} \cdot p_2^{a_2} \cdots p_r^{a_r} is the prime factorisation, then the number of positive divisors of n is:
Why this works: every divisor of n has the form p_1^{b_1} \cdots p_r^{b_r} with 0 \leq b_i \leq a_i. Each exponent b_i has a_i + 1 choices independently, so the total count multiplies.
Check with 12 = 2^2 \times 3^1: \tau(12) = (2 + 1)(1 + 1) = 3 \times 2 = 6. Six divisors — matches the clock.
Check with 24 = 2^3 \times 3^1: \tau(24) = (3 + 1)(1 + 1) = 4 \times 2 = 8. Eight divisors: 1, 2, 3, 4, 6, 8, 12, 24.
Pairing around the square root
On the factor clock, divisors fold in half around \sqrt{n}. Every divisor d \leq \sqrt{n} has a partner n/d \geq \sqrt{n}. This is why, to find all divisors of n, you only need to test candidates up to \sqrt{n} — each small divisor you find gives you a large one for free.
For n = 100, \sqrt{100} = 10. Test 1, 2, 3, \dots, 10. You find divisors 1, 2, 4, 5, 10. Pair them: 100, 50, 25, 20, 10. All nine divisors of 100 are 1, 2, 4, 5, 10, 20, 25, 50, 100. The middle one — 10 — pairs with itself.
Using the factor clock to list divisors of $36$
Step 1. Factor 36. 36 = 2^2 \times 3^2.
Step 2. Count divisors: \tau(36) = (2+1)(2+1) = 9.
Why: each exponent contributes one more than itself to the product — three choices for the power of 2 (namely 0, 1, 2) and three choices for the power of 3.
Step 3. List them by combining powers:
| Power of 2 | Power of 3 | Divisor |
|---|---|---|
| 0 | 0 | 1 |
| 1 | 0 | 2 |
| 2 | 0 | 4 |
| 0 | 1 | 3 |
| 1 | 1 | 6 |
| 2 | 1 | 12 |
| 0 | 2 | 9 |
| 1 | 2 | 18 |
| 2 | 2 | 36 |
So the divisors are \{1, 2, 3, 4, 6, 9, 12, 18, 36\} — nine of them, matching the formula.
Step 4. Pair them around \sqrt{36} = 6: (1, 36), (2, 18), (3, 12), (4, 9), (6, 6). The divisor 6 pairs with itself — which is why the count is odd.
Step 5. Light them on the clock. Nine positions out of 36 are lit. If you drew a vertical line through the position labelled 6, every lit divisor on one side has a mirror partner on the other — except 6 itself, which sits on the axis of symmetry.
The clock for highly composite numbers
Some numbers are chosen as calendar or timekeeping units because their factor clocks are so full. Consider:
- 12 = 2^2 \times 3: 6 divisors (1, 2, 3, 4, 6, 12) — used for months, hours on a clock face.
- 24 = 2^3 \times 3: 8 divisors (1, 2, 3, 4, 6, 8, 12, 24) — used for hours in a day.
- 60 = 2^2 \times 3 \times 5: 12 divisors (1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60) — used for minutes, seconds, and sexagesimal numeration in Babylon.
- 360 = 2^3 \times 3^2 \times 5: 24 divisors — used for degrees in a circle.
The choice of 60 and 360 is not coincidence. These numbers were chosen because their factor clocks light up so many positions — they are naturally divisible by many small factors, so they make clean fractions (1/2, 1/3, 1/4, 1/5, 1/6 of 60 are all whole numbers).
The one-line takeaway
Arrange 1 through n around a circle and light up the divisors. The lit pattern instantly shows you how composite n is: primes light two dots, perfect squares give odd divisor counts, and numbers like 12 or 60 light many dots because their prime factorisations have many small components. The factor clock turns \tau(n) into geometry.
Related: Number Theory Basics · Divisibility Tree Explorer · Sieve of Eratosthenes · Ulam Spiral · Number Systems