How Prime Factorization Works
Prime factorization is the process of expressing a positive integer as a product of prime numbers. Every integer greater than 1 can be written as a unique product of primes — this is the Fundamental Theorem of Arithmetic. Prime factorization is the foundation for calculating GCD and LCM, simplifying fractions, and forms the basis of modern encryption (RSA cryptography relies on the difficulty of factoring large numbers).
Google ad
Formula
Prime Factorization
Break any integer into its prime factors and check if it is a prime number.
Google ad
Worked Example
Given:
Related Calculators
FAQs
How do I manually find prime factors?
Use trial division: start with 2 and divide as many times as possible, then try 3, 5, 7, 11, and so on through primes up to the square root of the number. Any remaining factor greater than 1 is itself prime. For example: 84 ÷ 2 = 42 ÷ 2 = 21 ÷ 3 = 7. So 84 = 2² × 3 × 7.
How is prime factorization used in cryptography?
RSA encryption (used in HTTPS, banking, and secure communications) relies on the fact that multiplying two large primes is easy, but factoring the result back into the two primes is computationally infeasible for large numbers. A 2048-bit RSA key uses primes with hundreds of digits.
What is the largest known prime number?
As of early 2024, the largest known prime is 2^136,279,841 − 1, discovered in 2024 — a number with over 41 million digits. It is a Mersenne prime (of the form 2^p − 1). Large primes are found using distributed computing projects like GIMPS (Great Internet Mersenne Prime Search).