36 is the smallest number with nine divisors, and the square of 6 as well as 2² × 3². Squares always have an odd number of divisors, because divisors pair off except for the square root, which pairs with itself. It is not prime. 36 = 2 × 2 × 3 × 3, so it has 9 divisors rather than two, and the small...
WORTH TRYING
36 IS
NOT PRIME
SMALLEST FACTOR
2
36 = 2^2 × 3^2
Prime factorisation
2^2 × 3^2
Number of divisors
9
Sum of divisors
91
Totient φ(n)
12
Previous prime
31
Next prime
37
FACTOR BREAKDOWN
PRIME
POWER
CONTRIBUTES
2
2
4
3
2
9
STEPS
Trial-divide 36 by every prime up to √36 ≈ 6 — beyond that a factor would have a partner below it
The smallest prime divisor is 2, so 36 is composite
Full factorisation: 2^2 × 3^2
36 is NOT prime
SIEVE OF ERATOSTHENES
Two thousand years old and still the fastest way. Take the first uncrossed number, 2, and strike out every multiple of it. Move to the next survivor, 3, and repeat. Each pass can start at the square of its prime, because anything smaller was already struck by a smaller factor — which is why the passes get shorter and stop entirely once the prime exceeds √100. Whatever survives is prime. Your number 36 is outlined in gold.
HOW MANY PRIMES BELOW x — AND WHAT THE THEORY PREDICTS
Actual count against x ÷ ln x. At x = 10 the estimate overshoots slightly; from 100 upward it runs low, and from 1,000 onward the gap narrows steadily — a ratio of 1.16 at a thousand down to 1.10 at a hundred thousand. That it tends to 1 at all is the Prime Number Theorem, and how slowly it does so is why the proof took a century to find.
Proved, not guessed. Primality here uses a deterministic Miller–Rabin test with a fixed witness set that is proven correct for every number this page accepts, so a result of PRIME is a proof rather than a probability. Ranges are sieved up to 200,000; single numbers are tested up to 4,503,599,627,370,495.
Live simulation · drawn to scale · updates as you type
The answer is already on screen: 36 is not prime, because 36 = 2 × 2 × 3 × 3. Nothing needs typing — this page opens the calculator with 36 loaded.
Read the STEPS panel to see the reasoning: the smallest prime divisor of 36 is 2, which is enough to settle it, and the full factorisation 2^2 × 3^2 follows.
Check the six tiles for the derived quantities — divisor count, divisor sum, Euler's totient and the primes either side. All of them come from the factorisation rather than from separate searches.
Type a different number to carry on, or switch to RANGE to sieve a whole interval at once and see how the primes thin out as the numbers grow.
Binary Converter
Calculate instantly →
Hexadecimal Converter
Calculate instantly →
4 in Binary
Calculate instantly →
Random Number Generator
Calculate instantly →
8 in Binary
Calculate instantly →
16 in Binary
Calculate instantly →
10 in Binary
Calculate instantly →
1 in Binary
Calculate instantly →
255 in Binary
Calculate instantly →
2 in Binary
Calculate instantly →
6 in Binary
Calculate instantly →
9 in Binary
Calculate instantly →
11 in Binary
Calculate instantly →
14 in Binary
Calculate instantly →
128 in Binary
Calculate instantly →
5 in Binary
Calculate instantly →
7 in Binary
Calculate instantly →
12 in Binary
Calculate instantly →
32 in Binary
Calculate instantly →
3 in Binary
Calculate instantly →
Last updated: July 29, 2026 · Formula verified · Deterministic Miller–Rabin, so a result of PRIME is proven rather than probable · Eagle-eyed accuracy for every calculation.