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