Prime factorization is the "DNA test" for whole numbers. Every integer greater than 1 breaks down into exactly one set of prime numbers multiplied together — no other combination will match. This simple fact, called the Fundamental Theorem of Arithmetic, powers much of number theory and a surprising amount of modern cryptography.
What is a prime number?
A prime number has exactly two divisors: 1 and itself. The first several primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. The number 1 is not prime (only one divisor). The number 2 is the only even prime — every other even number is divisible by 2.
What "prime factorization" means
Take any composite number — say 60. You can write it as a product of primes: 60 = 2 × 2 × 3 × 5, or 2² × 3 × 5. That is the prime factorization. It is unique: no other combination of primes multiplies to 60.
The factor tree method
The factor tree is a visual method that works for any number. Here is 360:
360
/ \
2 180
/ \
2 90
/ \
2 45
/ \
3 15
/ \
3 5
Rules of the tree:
- Start at the top with your number.
- Split it into any two factors (they do not have to be prime).
- Keep splitting composite branches until every leaf is prime.
- Multiply all the leaves: 2 × 2 × 2 × 3 × 3 × 5 = 360. ✓
In exponent form: 360 = 2³ × 3² × 5. It does not matter which splits you choose — the final leaves will always be the same primes.
The ladder (division) method
Prefer a table? Divide by the smallest prime that fits, over and over:
2 | 360
2 | 180
2 | 90
3 | 45
3 | 15
5 | 5
1
Reading down the left column: 2, 2, 2, 3, 3, 5. Same answer: 2³ × 3² × 5. The ladder is often faster for big numbers because you never have to guess splits.
Divisibility shortcuts that save time
- 2: last digit is even
- 3: sum of digits is divisible by 3
- 5: last digit is 0 or 5
- 7: no easy test — just try dividing
- 11: alternating sum of digits is divisible by 11
Use these to check each prime quickly before diving into long division.
How far do you need to check?
To test whether a number n is prime, you only need to try dividing by primes up to √n. If none of them divide n, it is prime. For 97: √97 ≈ 9.8. Try 2, 3, 5, 7. None work. Therefore 97 is prime.
This saves enormous time. For 997, you only need to check primes up to about 31.
Why prime factorization matters
1. Simplifying fractions
84/120 → 2² × 3 × 7 / 2³ × 3 × 5. Cancel common factors (2² × 3): 7/10.
2. Finding GCF and LCM
GCF takes the lowest power of each shared prime. LCM takes the highest. For 12 (2² × 3) and 18 (2 × 3²): GCF = 2 × 3 = 6, LCM = 2² × 3² = 36.
3. Working with exponents
Square roots simplify cleanly when you see the primes. √72 = √(2³ × 3²) = 6√2. Without prime factorization, you have to guess perfect-square factors.
4. Cryptography
RSA encryption, which protects banking and secure web traffic, relies on the fact that multiplying two huge primes is easy but factoring their product back into primes is believed to be computationally hard. Prime factorization is literally the math that keeps your bank transfers private.
Special numbers to know
Perfect squares have even exponents in their prime factorization. 36 = 2² × 3² — both exponents even — so √36 is a whole number (6).
Perfect cubes have exponents divisible by 3. 216 = 2³ × 3³; the cube root is 2 × 3 = 6.
1 has no prime factors. By convention, an "empty product" equals 1.
Practice problems
- Prime-factorize 144. (Answer: 2⁴ × 3²)
- Prime-factorize 225. (Answer: 3² × 5²)
- Is 131 prime? (Answer: yes — check primes up to √131 ≈ 11.4)
Automate the tedium
Our GCF and LCM calculator shows the full prime factorization of every number you enter, so you can double-check your tree or skip straight to GCF/LCM work. Prime factorization is one of those rare skills that pays off in fractions, algebra, geometry, and even computer security. Worth every minute of practice.