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 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?