No ads, no sign-upChecked 2026-06-18

Prime Factorization Calculator

Result

2^3 × 3^2 × 5

Result: 2^3 × 3^2 × 5

Divide out the smallest prime that fits, again and again, until nothing is left. 360 gives 2 three times, 3 twice and 5 once, so 360 = 2^3 × 3^2 × 5. Every whole number above 1 has exactly one such decomposition.

The numbers at a glance

Number to factorizeResult
100100
200200
300300
360Your value360
400400
500500
600600
700700

Worked examples

How it's calculated

n = p₁^e₁ × p₂^e₂ × … × pₖ^eₖ

  1. StepDivide by 2 as often as it goes, counting how many times.
  2. StepMove on to 3, then 5, 7 and the odd numbers above.
  3. ResultStop once the divisor squared passes the remainder — that remainder is prime.

What this number means

Every whole number above 1 is either prime or a product of primes, and that product is unique apart from the order of its factors. This is the fundamental theorem of arithmetic, and it is why a factorization is an answer rather than one answer among several: 360 is 2 × 2 × 2 × 3 × 3 × 5 and nothing else. Writing it in exponent form keeps it short. Three twos, two threes and one five become 2^3 × 3^2 × 5, where the exponent counts how often that prime divides the number. Finding the factors is trial division. Take out every 2 you can, then every 3, then 5, 7 and upwards through the odd numbers. You can stop as soon as the divisor squared is larger than what is left over: any remaining factor smaller than that would already have been removed, so whatever remains above 1 must itself be prime. That is why checking 97 costs only a handful of divisions — after 3, 5 and 7 the square already passes 97. The decomposition is the foundation for other work. The greatest common divisor is built from the primes two numbers share, the least common multiple from the higher exponent of each prime, and a fraction reduces to lowest terms exactly when numerator and denominator have no prime in common.

The square root ends the search

Once your divisor squared exceeds the remainder, stop. Whatever is left above 1 is prime, because a smaller factor would have been divided out already.

The exponent counts repeats

2^3 means 2 divides the number three times, not that 2 and 3 are both factors. 2^3 × 3^2 × 5 is 8 × 9 × 5 = 360.

A prime factorizes to itself

97 has no factors besides 1 and itself, so its factorization is simply 97. That is the calculator telling you the number is prime.

1 has no factorization

It is neither prime nor composite, and 0 divides by everything. That is why the input starts at 2, the smallest prime.

Commonly misread

1 counts as a prime factor of every number.

1 is not prime. Allowing it would give endless factorizations of the same number and break their uniqueness.

2^3 × 3^2 means the factors are 2, 3, 3 and 2.

It means three twos and two threes: 2 × 2 × 2 × 3 × 3. The raised number is a count, not a factor.

You have to test every number up to n to be sure.

Testing divisors only up to the square root is enough. Beyond it, any factor left over is prime.

Reference table

NumberPrime factorizationFactors with multiplicity
221
122^2 × 33
17171
362^2 × 3^24
642^66
97971
1002^2 × 5^24
3602^3 × 3^2 × 56
10002^3 × 5^36

Questions

How do I find the prime factorization of a number?

Divide by the smallest prime that fits and repeat with the quotient. For 360: 2, 2, 2, then 3, 3, then 5, which gives 2^3 × 3^2 × 5.

Why is the factorization unique?

The fundamental theorem of arithmetic guarantees it: every integer above 1 has exactly one set of prime factors, apart from their order. That uniqueness is what makes it useful for comparing numbers.

What does the calculator show for a prime number?

The number itself. 97 has no divisors besides 1 and 97, so the factorization is just 97 — which is the answer to whether it is prime.

Why does the input start at 2?

1 is neither prime nor composite and has no prime factorization, and 0 is divisible by every number. The smallest number with a factorization is 2, the smallest prime.

What is the factorization good for?

It gives the greatest common divisor from the primes two numbers share, the least common multiple from the higher exponents, and it shows at a glance whether a fraction can still be reduced.

Sources and last check

  1. mathworld.wolfram.com

Information, not professional advice.