Prime Factorization Calculator

📚 Explanation

What is prime factorization?

Prime factorization means writing a whole number as a product of prime numbers. A prime number is a number greater than 1 that has exactly two positive divisors: 1 and itself (2, 3, 5, 7, 11, 13, …). A composite number has more than two divisors (like 12, 18, 40, 100).

When you prime-factorize a number, you’re breaking it down into its “building blocks.” For example, 60 can be built from primes as 60 = 2 × 2 × 3 × 5. In exponent form: 60 = 2² × 3 × 5.

This isn’t just a random representation. The reason it matters is the Fundamental Theorem of Arithmetic: every integer greater than 1 can be written as a product of primes in a way that is unique, except for the order of the factors. So 60 will always reduce to the same prime factors (2, 2, 3, 5) no matter which valid method you use.

Prime factorization formula (the “exponent form”)

If you factor a number n into primes, you can write it in a compact standard form:

n = p₁^a₁ × p₂^a₂ × … × p_k^a_k

Here, p₁, p₂, …, p_k are distinct prime numbers, and the exponents a₁, a₂, …, a_k are positive integers telling you how many times each prime repeats. Example:

360 = 2³ × 3² × 5
84 = 2² × 3 × 7
999 = 3³ × 37

How the calculator works (trial division)

The most common “human-friendly” method is trial division. You test small prime numbers (2, 3, 5, 7, …) and repeatedly divide as long as the division is exact. Every time a prime divides the number evenly, that prime is one of the factors. You keep dividing until the remaining value becomes 1.

Example: Factor 360.

360 ÷ 2 = 180 (so 2 is a factor)
180 ÷ 2 = 90 (another 2)
90 ÷ 2 = 45 (another 2, so far 2³)
45 ÷ 3 = 15 (3 is a factor)
15 ÷ 3 = 5 (another 3, so far 3²)
5 ÷ 5 = 1 (5 is a factor)

So 360 = 2³ × 3² × 5. The calculator does the same thing, but instantly and without mistakes.

Optimization note (why it’s fast): once you’ve tried all primes up to √n, if what’s left is greater than 1, that leftover must itself be prime. That’s because any composite number has a factor ≤ √n. This “square root bound” is what makes trial division practical for typical calculator inputs.

Step-by-step “prime factor ladder” vs factor tree

You might have learned prime factorization using a factor tree in school: split 360 into 36 × 10, then 36 into 6 × 6, then 6 into 2 × 3, etc. That works, but the tree can get messy for large numbers.

A cleaner alternative is the prime factor ladder (repeated division): write the number, divide by the smallest prime that fits, repeat. This calculator can show ladder-style steps so you can follow the exact sequence.

Examples you can copy or screenshot

Example 1: 84

84 ÷ 2 = 42, 42 ÷ 2 = 21, 21 ÷ 3 = 7, 7 ÷ 7 = 1 → 84 = 2² × 3 × 7.

Example 2: 1000

1000 ÷ 2 = 500 ÷ 2 = 250 ÷ 2 = 125 (so 2³), then 125 ÷ 5 = 25 ÷ 5 = 5 ÷ 5 = 1 (so 5³). Therefore 1000 = 2³ × 5³.

Example 3: 999

999 ÷ 3 = 333 ÷ 3 = 111 ÷ 3 = 37 (so 3³), and 37 is prime, so 999 = 3³ × 37.

Why prime factorization is useful (real reasons)

Simplifying fractions: If you factor numerator and denominator, you can cancel common primes quickly.
Finding the GCF: The GCF is built from shared prime factors with the smallest exponents.
Finding the LCM: The LCM is built from all primes with the largest exponents.
Counting divisors: From n = p₁^a₁…p_k^a_k, the number of positive divisors is (a₁+1)…(a_k+1).
Math puzzles & coding: Many puzzles are disguised factorization problems, and many algorithms start with prime factors.

FAQ

Does every number have a prime factorization?
Every integer greater than 1 does. The number 1 is a special case: it has no prime factors. In this calculator, entering 1 will return “no prime factors” rather than forcing a meaningless output.
What about 0 or negative numbers?
Prime factorization is typically defined for positive integers greater than 1. If you enter a negative number, the calculator factors its absolute value and includes −1 as a sign factor. If you enter 0, there is no finite prime factorization (0 is divisible by every prime), so the calculator will explain that.
Why do you stop checking primes at √n?
If n has any composite structure left, it must have a factor at most √n. So once you’ve tested primes up to √n, anything remaining (greater than 1) must be prime. This rule makes the algorithm much faster.
Can two different prime factorizations be correct?
Only in the order of multiplication. For example, 60 = 2×2×3×5 is the same as 60 = 5×3×2×2. But the set of primes (with their counts) is unique.
What’s the fastest way to factor a number by hand?
Start with 2 (keep dividing while even), then 3, then 5, 7, 11… and stop when the prime you’re testing exceeds √(remaining). For “nice” numbers, spotting divisibility rules (by 3, 9, 11, etc.) speeds things up a lot.
Is this calculator good for huge numbers?
It’s designed for everyday use (school math, quick checks, typical values). Trial division is fast for moderate inputs, but factoring extremely large integers can become slow without advanced algorithms. For viral sharing and practical use, most users are factoring numbers under a few billion — which is typically fine.

Quick formula recap

Prime factorization form: n = ∏ p^a
GCF from factorization: take shared primes with minimum exponents.
LCM from factorization: take all primes with maximum exponents.
Number of divisors: (a₁+1)(a₂+1)…(a_k+1)

Enter a number