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 720

720 = 2^4 × 3^2 × 5, which is 2 × 2 × 2 × 2 × 3 × 3 × 5 written out in full.

  • Exponent form2^4 × 3^2 × 5
  • Product form2 × 2 × 2 × 2 × 3 × 3 × 5
  • Divisor count30
  • Divisor sum2418
Divisor list
#DivisorPaired divisor
11720
22360
33240
44180
55144
66120
7890
8980
91072
101260
111548
121645
131840
142036
152430
163024
173620
184018
194516
204815
216012
227210
23809
24908
251206
261445
271804
282403
293602
307201
  • 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?