Prime Factorization Calculator
Prime Factorization Calculator
Enter any whole number (2 or greater). This finds its prime factorization — the unique set of prime numbers that multiply together to produce the original number.
The method repeatedly divides the number by the smallest possible prime (starting at 2), continuing with that same prime until it no longer divides evenly, then moving on to the next prime, until only 1 remains. Every whole number greater than 1 has exactly one prime factorization — this is the Fundamental Theorem of Arithmetic, and it's the reason prime factorization is the standard method for finding a number's GCD, LCM, and full list of factors by hand.
- How it's found: repeatedly divide the number by the smallest possible prime (starting at 2), continuing with that same prime until it no longer divides evenly, then moving to the next prime, until only 1 remains.
- Every number has exactly one prime factorization: this is the Fundamental Theorem of Arithmetic — aside from the order the factors are written in, there's only one way to break any number down into primes.
- Prime numbers factor into just themselves: if a number is already prime, its "factorization" is simply that number by itself, with no further breakdown possible.
What does the exponent in the factorization mean?
An exponent shows how many times that prime factor appears — for example, 2² in the factorization of 60 means 2 appears twice (2 × 2 × 3 × 5 = 60).
Why is prime factorization useful?
It's the foundation for finding GCD and LCM efficiently, simplifying fractions and radicals, and is central to number theory and cryptography.
Prime Factorization Calculator
Enter any whole number (2 or greater). This finds its prime factorization — the unique set of prime numbers that multiply together to produce the original number.
The method repeatedly divides the number by the smallest possible prime (starting at 2), continuing with that same prime until it no longer divides evenly, then moving on to the next prime, until only 1 remains. Every whole number greater than 1 has exactly one prime factorization — this is the Fundamental Theorem of Arithmetic, and it's the reason prime factorization is the standard method for finding a number's GCD, LCM, and full list of factors by hand.
- How it's found: repeatedly divide the number by the smallest possible prime (starting at 2), continuing with that same prime until it no longer divides evenly, then moving to the next prime, until only 1 remains.
- Every number has exactly one prime factorization: this is the Fundamental Theorem of Arithmetic — aside from the order the factors are written in, there's only one way to break any number down into primes.
- Prime numbers factor into just themselves: if a number is already prime, its "factorization" is simply that number by itself, with no further breakdown possible.
What does the exponent in the factorization mean?
An exponent shows how many times that prime factor appears — for example, 2² in the factorization of 60 means 2 appears twice (2 × 2 × 3 × 5 = 60).
Why is prime factorization useful?
It's the foundation for finding GCD and LCM efficiently, simplifying fractions and radicals, and is central to number theory and cryptography.