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.

How to use

  1. Enter one integer per line, such as 360.
  2. Choose the output format (product plus exponents / product only / exponents only).
  3. Click Start calculation; the result table shows both notations, divisor count, and divisor sum, with one-click copy and CSV export.
Factorization

Prime factorization of 5040

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

  • Exponent form2^4 × 3^2 × 5 × 7
  • Product form2 × 2 × 2 × 2 × 3 × 3 × 5 × 7
  • Divisor count60
  • Divisor sum19344
Divisor list
#DivisorPaired divisor
115040
222520
331680
441260
551008
66840
77720
88630
99560
1010504
1112420
1214360
1315336
1416315
1518280
1620252
1721240
1824210
1928180
2030168
2135144
2236140
2340126
2442120
2545112
2648105
275690
286084
296380
307072
317270
328063
338460
349056
3510548
3611245
3712042
3812640
3914036
4014435
4116830
4218028
4321024
4424021
4525220
4628018
4731516
4833615
4936014
5042012
5150410
525609
536308
547207
558406
5610085
5712604
5816803
5925202
6050401
  • 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?