MATMathematics

Prime Factorization

Find the prime factors of any number. See the complete prime factorization, check if a number is prime, and count total divisors.

Try an example

How It Works

Formula

n=p1a1×p2a2××pkakn = p_1^{a_1} \times p_2^{a_2} \times \cdots \times p_k^{a_k}

d(n)=(a1+1)(a2+1)(ak+1)d(n) = (a_1 + 1)(a_2 + 1) \cdots (a_k + 1)

Where

nn

The integer being factored (n ≥ 2)

pip_i

The i-th distinct prime factor of n

aia_i

The exponent of the i-th prime in the factorization

kk

Number of distinct prime factors

d(n)d(n)

Total number of positive divisors of n

The calculator uses trial division: it divides the number by each integer starting from 2, counting how many times each prime divides evenly. The process continues until the remaining quotient is 1.

Frequently Asked Questions

Related Calculators

Ready to Calculate?

Free calculators.