Home›Math Tools›Prime Factorization Calculator
Number Theory

Prime Factorization Calculator — Break Down Any Number

Enter a whole number and instantly see its full breakdown into prime factors, complete with exponents, plus a quick check for whether the number itself is prime.

Advertisement

🔢 Enter a Number

🔢 Result

Enter a whole number 2 or greater to see its prime factorization
⚠️

Disclaimer: This tool performs standard mathematical calculations for educational and reference purposes. Very large numbers (many digits) may take longer or exceed safe precision in the browser — always double-check results independently for graded coursework or critical applications.

What Prime Factorization Means

Prime factorization is the process of writing a whole number as a product of prime numbers — numbers greater than 1 that can only be divided evenly by 1 and themselves. Every integer greater than 1 has exactly one such breakdown (ignoring the order of the factors), which is why mathematicians call it the fundamental theorem of arithmetic. For example, 84 factors into 2 × 2 × 3 × 7, usually written compactly as 2² × 3 × 7.

How the Calculator Finds the Factors

This tool uses trial division, the most direct way to factor a number by hand or by computer. It first strips out every factor of 2, then tests each odd number starting from 3 up to the square root of what's left, dividing it out and counting how many times each prime divides evenly. Anything still greater than 1 after that loop finishes must itself be a prime factor, since we've already ruled out every smaller possible divisor.

Worked Example

Let's factor 84:

  1. Step 1: 84 is even, so divide by 2 → 42. Divide by 2 again → 21. 21 is odd, so we stop dividing by 2. That's 2² so far.
  2. Step 2: Try 3 next: 21 ÷ 3 = 7. That's 3¹.
  3. Step 3: 7 is left, and √7 ≈ 2.65, which is smaller than 7 itself, so we stop testing — 7 must be prime.
  4. Result: 84 = 2² × 3 × 7

Frequently Asked Questions

Neither. By definition a prime number needs exactly two distinct positive divisors (1 and itself), but 1 only has one divisor — itself. Mathematicians classify 1 as a special case, not prime and not composite, so it has no prime factorization.
If n has a factor larger than √n, it must be paired with a factor smaller than √n (since their product is n). So if no divisor up to √n works, no larger one will either — any remaining unfactored value must itself be a single prime.
Every integer greater than 1 breaks down into prime factors in exactly one way, ignoring the order you write them in. This uniqueness is what lets prime factorization act as a kind of numeric fingerprint — it's the backbone of topics like finding the GCD, LCM, and simplifying fractions.
Advertisement