Prime Factorization Calculator

Every whole number greater than 1 can be broken down into a unique product of prime numbers. This is the Fundamental Theorem of Arithmetic, and it's one of the bedrock facts of number theory. The number 360 is 2³ × 3² × 5. No other combination of primes gives 360. The prime factorization is like a fingerprint — completely unique to each number, and useful for understanding everything from how the number behaves in division to how it connects to other numbers through GCF and LCM.

Cryptography's Dependence on Large Primes

RSA encryption — the backbone of secure internet communication — depends on the fact that factoring very large numbers is computationally difficult. Multiplying two 300-digit primes together takes milliseconds. Factoring the resulting 600-digit number back into its two prime components could take longer than the age of the universe with current algorithms and hardware. This asymmetry between easy multiplication and hard factorization is what makes public-key cryptography work.

Your bank uses prime factorization difficulty to protect your financial transactions. Every time you see HTTPS in a browser, large-prime arithmetic is keeping your data safe. Prime factorization of small numbers is trivial. Prime factorization of 2048-bit numbers is, for now, computationally beyond reach.

Using This Calculator

Enter any positive whole number and the calculator returns its complete prime factorization in exponential notation. For small numbers (up to a few thousand), results are instantaneous. For large numbers, computation takes a bit longer because the algorithm must test more potential prime factors.

After getting the factorization, count the exponents to find the number of divisors: (e₁+1)(e₂+1)... If the factorization contains a prime only to the first power (exponent 1), that prime is non-redundant — removing it from the factorization would give a different number. Large exponents signal numbers that are "smooth" in number theorist's language — close to a power of a small prime, which makes them appear frequently in certain mathematical contexts.

What Prime Numbers Are

A prime number is a positive integer greater than 1 that has no factors other than 1 and itself. The first few primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. Note that 1 is not prime — by convention, it's excluded because including it would break the uniqueness of factorization (you could always tack on more 1s without changing the product). And 2 is the only even prime; all other even numbers are divisible by 2 and therefore not prime.

Here's the thing: primes are the atoms of multiplication. Every composite number (non-prime) is a product of primes, and those primes are the irreducible building blocks. You can't factor primes further. That irreducibility is what makes them special.

The Factor Tree Method

The most visual way to find prime factorization is a factor tree. Take 180. Split it into any two factors: 2 × 90. Split 90: 2 × 45. Split 45: 3 × 15. Split 15: 3 × 5. Both 3 and 5 are prime — stop. Reading all the primes at the leaves: 180 = 2 × 2 × 3 × 3 × 5 = 2² × 3² × 5.

The beauty of a factor tree is that no matter which factors you start with, you always end up with the same set of prime factors. If you started 180 as 4 × 45 instead of 2 × 90, you'd still arrive at 2² × 3² × 5. The path differs; the destination doesn't.

Division Method

An alternative is repeated trial division. Divide your number by the smallest prime possible, keep the result, and repeat. For 420: 420/2 = 210. 210/2 = 105. 105/3 = 35. 35/5 = 7. 7 is prime — stop. Prime factorization: 2² × 3 × 5 × 7. This method is systematic and easy to code, which is why it's the basis for how computers compute prime factorizations.

You only need to test primes up to the square root of the number. If a number n has no prime factor up to √n, it must be prime itself. For 221: √221 ≈ 14.9. Test primes up to 14: 2 (no), 3 (no), 5 (no), 7 (no), 11 (no), 13: 221/13 = 17. So 221 = 13 × 17 — not prime, but its factors only appear when you check up to √221.

Using Prime Factorization to Find GCF and LCM

Prime factorization is the most reliable method for computing GCF and LCM of numbers. To find GCF, factor both numbers and take the minimum power of each shared prime. To find LCM, take the maximum power of each prime that appears in either factorization.

Say you're a 27-year-old mechanical engineer in Detroit designing gear ratios. You need gears with 84 and 120 teeth respectively to mesh efficiently, and you want to understand their common structure. 84 = 2² × 3 × 7 and 120 = 2³ × 3 × 5. Shared primes: 2 (minimum power is 2²) and 3 (minimum power is 3¹). GCF = 4 × 3 = 12. Every 12th tooth on the smaller gear aligns with every tooth of a 12-tooth period on the larger gear. The LCM = 2³ × 3 × 5 × 7 = 840 teeth of relative rotation before the gears return to their starting configuration. These numbers tell you about wear patterns and resonance frequencies in the drivetrain.

Prime Factorization and Divisibility

Once you have the prime factorization of a number, you can determine all its divisors systematically. A number with prime factorization p₁^a₁ × p₂^a₂ × ... has exactly (a₁+1)(a₂+1)... divisors. So 360 = 2³ × 3² × 5¹ has (3+1)(2+1)(1+1) = 4 × 3 × 2 = 24 divisors. And you can list all 24 by taking every combination of prime powers: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120, 180, 360.

Interesting Patterns in Prime Factorizations

Perfect squares have every prime appearing an even number of times: 36 = 2² × 3² (both powers even). Perfect cubes have every prime appearing in multiples of 3: 216 = 2³ × 3³. Highly composite numbers — numbers with unusually many divisors — tend to have small primes with large exponents. 720 = 2⁴ × 3² × 5 has 30 divisors, making it extremely divisible and useful in ancient measurement systems (360 degrees in a circle, 60 minutes in an hour — both inherit their divisibility from these prime structures).