Prime Factorization
Breaks a whole number down into the primes that multiply together to make it, showing the factorization in exponent form, the full list of factors, the distinct primes involved, and how many divisors the number has. Works on numbers up to a trillion. Runs entirely in your browser — nothing is sent to a server.
Breaks a whole number down into the primes that multiply together to make it, showing the factorization in exponent form, the full list of factors, the distinct primes involved, and how many divisors the number has. Works on numbers up to a trillion. Runs entirely in your browser — nothing is sent to a server.
Use cases
- Finding the prime factors for a homework question
- Working out how many divisors a number has
Examples
Twelve
12
{
"number": 12,
"isPrime": false,
"factorization": "2^2 × 3",
"factors": [
2,
2,
3
],
"distinctPrimes": [
2,
3
],
"divisorCount": 6
}FAQ
Is my data sent to a server?
No — this tool runs entirely in your browser.
How is the divisor count worked out?
By adding one to each prime's exponent and multiplying the results. 12 is 2^2 × 3, so it has (2+1) × (1+1) = 6 divisors.
Why is there an upper limit?
Factoring by trial division takes time proportional to the square root of the number. A trillion stays instant; much larger values would freeze the page.