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
Prime factorization calculator splits integers into a product of primes, one number per line, with batch paste supported.
For example, 360 = 2 × 2 × 2 × 3 × 3 × 5 = 2^3 × 3^2 × 5, with 24 divisors and a divisor sum of 1170.
The algorithm uses BigInt: small factors are first stripped using primes below 1000, then Miller-Rabin checks primality and Pollard rho splits composites; composites up to 18 digits are factored quickly. Composites that are too large to factor are skipped with a notice, so no wrong result is returned.
For example, 360 = 2 × 2 × 2 × 3 × 3 × 5 = 2^3 × 3^2 × 5, with 24 divisors and a divisor sum of 1170.
The algorithm uses BigInt: small factors are first stripped using primes below 1000, then Miller-Rabin checks primality and Pollard rho splits composites; composites up to 18 digits are factored quickly. Composites that are too large to factor are skipped with a notice, so no wrong result is returned.
How to use
- Enter one integer per line, such as
360. - Choose the output format (product plus exponents / product only / exponents only).
- Click Start calculation; the result table shows both notations, divisor count, and divisor sum, with one-click copy and CSV export.
Common inputs
Message board
All messages →-
No one has spoken up yet — want to go first?