Prime Factorization Calculator

Break down any positive integer into its prime factors with step-by-step division

About the Prime Factorization Calculator

This prime factorization calculator breaks down any positive integer greater than 1 into its prime factors using repeated division by the smallest primes. It displays the result with exponents, shows every division step, and also calculates the total number of factors from the prime factorization.

The Formula

If n = p₁^e₁ × p₂^e₂ × ... × pₖ^eₖ, then total factors = (e₁+1)(e₂+2)...(eₖ+1)

Every integer greater than 1 has a unique prime factorization (Fundamental Theorem of Arithmetic). The exponents indicate how many times each prime divides the number.

Frequently Asked Questions

What is prime factorization used for?

Prime factorization is used to find the GCD and LCM of numbers, simplify fractions, determine divisibility, and solve problems in cryptography and number theory. It is also the foundation for understanding the structure of integers.

What if my number is already prime?

If the number is prime, its only prime factor is itself (with exponent 1). The calculator will correctly identify it as a prime number and display it as such. For example, the prime factorization of 17 is simply 17.