Prime Factorization Calculator
One integer per line - factor it into primes with exponent form, divisor count and divisor sum
Output:
Separator:
Calculation Result
Download CSV
| No. | Original | Factorization | Exponent form | Divisors | Sum of divisors |
|---|
Introduction to the tool and how to use it
Turn integers into a product of primes, one number per line, as many lines as you like.
How to use:
1. Enter one integer per line, e.g.
2. Choose the output form (product + exponent, product only, exponent only);
3. Hit Run to get both forms together with the divisor count and divisor sum - copy it or export as CSV.
For example 360 = 2 x 2 x 2 x 3 x 3 x 5 = 2^3 x 3^2 x 5, with 24 divisors adding up to 1170.
The maths uses BigInt: primes below 1000 strip the small factors, then Miller-Rabin tests primality and Pollard rho splits what is left, so any composite up to 18 digits is factored quickly. Composites that are too long to split are skipped with a notice rather than reported wrongly.
How to use:
1. Enter one integer per line, e.g.
360;2. Choose the output form (product + exponent, product only, exponent only);
3. Hit Run to get both forms together with the divisor count and divisor sum - copy it or export as CSV.
For example 360 = 2 x 2 x 2 x 3 x 3 x 5 = 2^3 x 3^2 x 5, with 24 divisors adding up to 1170.
The maths uses BigInt: primes below 1000 strip the small factors, then Miller-Rabin tests primality and Pollard rho splits what is left, so any composite up to 18 digits is factored quickly. Composites that are too long to split are skipped with a notice rather than reported wrongly.
Factorization
Prime factorization of 1024
1024 = 2^10, which is 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 written out in full.
- Exponent form2^10
- Product form2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2
- Divisor count11
- Divisor sum2047
Divisor list
| # | Divisor | Paired divisor |
|---|---|---|
| 1 | 1 | 1024 |
| 2 | 2 | 512 |
| 3 | 4 | 256 |
| 4 | 8 | 128 |
| 5 | 16 | 64 |
| 6 | 32 | 32 |
| 7 | 64 | 16 |
| 8 | 128 | 8 |
| 9 | 256 | 4 |
| 10 | 512 | 2 |
| 11 | 1024 | 1 |
- Divisors are listed in ascending order; the paired divisor is the one it multiplies with to give the original number.
Common inputs
Message board
All messages →-
No one has spoken up yet — want to go first?