Prime Factorization
Break any whole number into its prime factors.
How to use
- 1 Type a whole number of 2 or greater.
- 2 Read the prime factorization in exponent form.
- 3 See the expanded list of factors with repeats.
- 4 Check whether the number is prime.
- 5 Copy the result.
About Prime Factorization
The Prime Factorization tool breaks a whole number down into the prime numbers that multiply together to make it, the unique fingerprint guaranteed by the fundamental theorem of arithmetic.
Type any integer of two or greater and it returns the factorization in clear exponent form, such as 360 = 2^3 × 3^2 × 5, alongside the fully expanded list of factors with repeats so you can see exactly how the number is built.
When the number you enter is itself prime, the tool says so directly instead of just echoing it back.
Under the hood it uses trial division, peeling off factors of two and then testing odd divisors up to the square root of what remains, which keeps results exact with no floating-point rounding and is fast across a wide range of inputs.
It is handy for homework and number-theory practice, for simplifying fractions, for finding greatest common divisors and least common multiples by hand, and for understanding the structure of a number at a glance.
Very large values are capped at the safe integer limit so every answer it gives is mathematically exact rather than approximate.
Everything runs locally in your browser, so nothing you enter is uploaded, logged or stored, and the tool keeps working offline once the page has loaded.
FAQ
What does the exponent form mean?
An exponent shows how many times a prime divides the number. For example 2^3 means 2 × 2 × 2, so 360 = 2^3 × 3^2 × 5.
How large a number can it factor?
Up to the JavaScript safe integer limit (about 9 quadrillion). The trial-division method is fast for typical inputs and always returns an exact, rounding-free answer.
Is my input sent anywhere?
No. The factorization is computed entirely in your browser. Nothing you type is uploaded, logged or stored.