Online Tool Store
· 4 min read
How to Look Up the Properties of a Number
Manesh Jayawardhana
CIO & Co-founder
Why 60 seconds and not 100? Why 360 degrees? Why does a foot have 12 inches when the metric system won every other argument?
The answer to all three is divisibility, and it’s visible in the prime factorisation.
Everything follows from the factorisation
Break a number into primes and most of its other properties fall out.
Take 5040 = 2⁴ × 3² × 5 × 7.
Divisor count comes directly from the exponents: add one to each and multiply.
(4+1)(2+1)(1+1)(1+1) = 5 × 3 × 2 × 2 = 60 divisors
Sixty divisors — more than any smaller number has, which makes 5040 a highly composite number. It’s also 7 factorial, which is why it has so many small prime factors.
Primality is the trivial case: a prime has exactly one prime factor, itself.
Perfect, abundant and deficient depend on the sum of proper divisors relative to the number. A perfect number equals the sum of its proper divisors — 6 = 1+2+3, 28 = 1+2+4+7+14. They’re rare and the known ones are all even, and whether an odd perfect number exists is a famous open problem.
Why highly composite numbers run our clocks
A number with many divisors splits neatly many ways, which matters enormously when you’re dividing something physical without fractions.
60 = 2² × 3 × 5, giving 12 divisors. It splits into halves, thirds, quarters, fifths, sixths, tenths, twelfths, fifteenths, twentieths and thirtieths — all whole numbers. That’s why an hour has 60 minutes and a minute 60 seconds.
360 = 2³ × 3² × 5, giving 24 divisors. A circle divides into halves, thirds, quarters, fifths, sixths, eighths, ninths, tenths, twelfths and more, all in whole degrees.
12 has 6 divisors against 10’s 4, which is the practical argument for a dozen and for twelve inches.
100, by comparison, has only 9 divisors and no factor of 3 — you cannot divide 100 into thirds without fractions, which is a genuine inconvenience the metric system accepted in exchange for decimal arithmetic.
| Number | Factorisation | Divisors |
|---|---|---|
| 12 | 2² × 3 | 6 |
| 60 | 2² × 3 × 5 | 12 |
| 100 | 2² × 5² | 9 |
| 360 | 2³ × 3² × 5 | 24 |
| 5040 | 2⁴ × 3² × 5 × 7 | 60 |
Testing primality on large numbers
Trial division works up to the square root, which is fine for small numbers and hopeless for large ones.
Practical primality testing uses probabilistic methods — Miller-Rabin being the standard — which declare a number prime with an error probability that can be made vanishingly small by repeating the test. For cryptographic key generation, where numbers are hundreds of digits long, this is how it’s done.
Deterministic tests exist and are slower. In practice, “prime with probability 1 − 2⁻¹⁰⁰” is treated as prime.
Common mistakes to avoid
- Assuming a number ending in an odd digit is likely prime — divisibility by 3, 7, 11 and 13 removes most candidates.
- Confusing the divisor count with the number of prime factors.
- Assuming perfect numbers are common. Very few are known.
- Trial dividing a large number when a probabilistic test would answer in milliseconds.
- Forgetting that 1 is neither prime nor composite, by definition.
How to do it with Number Properties Lookup
The Number Properties Lookup leads with the factorisation.
- Enter any whole number.
- Read the prime factorisation first — nearly everything else follows from it.
- Check the divisor count when you need a number that divides neatly.
- Look at the notable properties for anything unusual about it.
The Online Encyclopedia of Integer Sequences is the reference for anything genuinely obscure. Other maths tools are in the tools directory.
Frequently asked questions
Why do highly composite numbers matter?
Because they divide neatly by many factors. It’s why 60 seconds, 60 minutes and 360 degrees survive — they split into halves, thirds, quarters, fifths and sixths without fractions.
How is primality tested for large numbers?
Trial division works for small numbers. Beyond that, probabilistic tests like Miller-Rabin give an answer with a vanishingly small error probability far faster than deterministic methods.
What is a digital root?
The single digit reached by repeatedly summing digits. It equals the number modulo 9, which is the basis of the old casting-out-nines arithmetic check.
Final thought
Look at the factorisation before anything else. Divisor counts, primality and most other properties are consequences of it, and the ones that surprise you usually have an explanation sitting right there.