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. 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 123456789

123456789 = 3^2 × 3607 × 3803, which is 3 × 3 × 3607 × 3803 written out in full.

  • Exponent form3^2 × 3607 × 3803
  • Product form3 × 3 × 3607 × 3803
  • Divisor count12
  • Divisor sum178422816
Divisor list
#DivisorPaired divisor
11123456789
2341152263
3913717421
4360734227
5380332463
61082111409
71140910821
8324633803
9342273607
10137174219
11411522633
121234567891
  • Divisors are listed in ascending order; the paired divisor is the one it multiplies with to give the original number.

Message board

All messages →
0/200

  • No one has spoken up yet — want to go first?