What Is Prime Factorization? Step-by-Step Guide
Prime factorization is the process of breaking a number down into the prime numbers that multiply together to produce it. Every whole number greater than 1 has exactly one prime factorization - this is such a fundamental property of numbers that it is known as the Fundamental Theorem of Arithmetic.
What Is a Prime Number?
A prime number is a whole number greater than 1 that has exactly two factors: 1 and itself. Examples include 2, 3, 5, 7, 11, and 13. Numbers that are not prime (other than 1, which is neither prime nor composite) are called composite numbers, and every composite number can be broken down into a unique combination of prime factors.
How to Find the Prime Factorization of a Number
The most common method is repeated division: divide the number by the smallest prime that divides it evenly, then repeat the process on the result, continuing until you are left with 1.
Worked Example: Prime Factorization of 60
60 / 2 = 30 (2 is prime)
30 / 2 = 15 (2 is prime)
15 / 3 = 5 (3 is prime)
5 / 5 = 1 (5 is prime)
So the prime factorization of 60 is: 2 x 2 x 3 x 5, often written using exponents as 2^2 x 3 x 5.
Using a Factor Tree
A factor tree is a visual way to reach the same result - you split a number into any two factors, then keep splitting each factor further until every branch ends in a prime number.
Example Factor Tree for 60
60 splits into 6 x 10
6 splits into 2 x 3 (both prime - stop here)
10 splits into 2 x 5 (both prime - stop here)
Reading all the prime "leaves" of the tree gives the same result: 2 x 3 x 2 x 5, which rearranges to the same 2^2 x 3 x 5 as the division method.
Why the Result Is Always the Same
No matter which factors you choose to split first, or whether you use repeated division or a factor tree, you will always arrive at the exact same set of prime factors for a given number (just possibly listed in a different order). This is exactly what the Fundamental Theorem of Arithmetic guarantees - prime factorization is unique.
How to Check If a Number Is Prime
A useful side effect of attempting prime factorization: if you try dividing a number by all primes up to its square root and find no divisors, the number itself is prime. You only need to check up to the square root because if a number has a factor larger than its square root, it must also have a corresponding factor smaller than the square root - so any factor pair would already have been caught.
Where Prime Factorization Is Used
- Finding GCD and LCM: Comparing the prime factorizations of two numbers is one method for identifying their greatest common divisor and least common multiple.
- Simplifying fractions and radicals: Recognizing shared prime factors helps reduce fractions and simplify square roots.
- Cryptography: Modern encryption methods rely on the fact that factoring very large numbers into their prime components is computationally difficult, even though verifying a factorization is easy.
Step-by-Step: Finding Prime Factorization Yourself
- Start with the smallest prime (2) and check if it divides your number evenly.
- If it does, divide and repeat with the result, using the smallest prime that works each time.
- If it does not, move to the next prime (3, then 5, then 7, and so on) and try again.
- Continue until you reach 1 - the primes you used along the way are your complete factorization.
Skip the Manual Math - Use Our Free Prime Factorization Calculator
Our free Prime Factorization Calculator instantly breaks down any number into its prime factors, tells you whether it is prime, and lists all of its factors - just enter a number.
Final Thoughts
Prime factorization is a mechanical, reliable process: keep dividing by the smallest prime that works until you reach 1. No matter which path you take to get there - repeated division or a factor tree - you will always land on the same unique set of prime factors, a guarantee that makes this one of the most dependable tools in basic number theory.