Prime Factorization Calculator

Break any whole number into its prime factors, with the divisor count, divisor sum, and a primality check.

Details

A whole number from 2 to 1,000,000,000,000.

Prime factorization of 360

2³ × 3² × 5

Built from 3 distinct primes

Written out in full2 × 2 × 2 × 3 × 3 × 5
The different primes used2, 3, 5
How many factors in total6

How many divisors

24

All divisors added up

1,170

Is it prime?

No

Biggest prime factor

5

This breaks a number down into the prime numbers that multiply together to make it, shown in exponent form.

It also gives every divisor, how many there are, and whether the number is prime.

What prime factorisation is

Prime factorisation breaks a number into the prime numbers that multiply to make it. 360 breaks down to 2³ × 3² × 5.

A prime is a whole number above 1 with no divisors except 1 and itself: 2, 3, 5, 7, 11, 13 and so on. They are the building blocks, because they cannot be broken down further.

Every whole number above 1 has exactly one prime factorisation. Not roughly one, exactly one, in one order. That guarantee is called the fundamental theorem of arithmetic, and it is why the technique is so useful.

Breaking 360 down
360start here
=
three 2s
×
two 3s
×
5one 5

Divide by the smallest prime that fits, over and over, until you reach 1. The order you find them in does not matter; the final set is always identical.

What to enter

Number (n)
Any whole number above 1. Very large numbers take longer, which is the whole basis of modern encryption.

Quick divisibility checks

By 2
The last digit is even.
By 3
The digits add up to a multiple of 3. For 360: 3+6+0 = 9, so yes.
By 5
It ends in 0 or 5.
By 9
The digits add to a multiple of 9.
By 11
Alternately add and subtract the digits; if the result is 0 or a multiple of 11, it divides.

What this assumes

1 is not prime, by definition. Allowing it would break the guarantee of a unique factorisation, since you could add as many 1s as you liked.

How to calculate the prime factors of a number

Keep dividing by the smallest prime that goes in, until nothing is left but 1.

n = p₁a × p₂b × p₃c ...
p
Each distinct prime factor
a, b, c
How many times each one appears
  1. Start with the smallest prime. Try 2 first. Keep dividing by 2 while the result stays whole.

  2. Move up when it stops working. Then try 3, then 5, then 7, and so on through the primes.

  3. Stop at 1. When the division reaches 1, you have every factor.

  4. Write it with exponents. Group repeats: 2 × 2 × 2 becomes 2³.

See a worked example: factorising 360
Number
360

360 ÷ 2 = 180. 180 ÷ 2 = 90. 90 ÷ 2 = 45. That is three 2s, and 45 is odd so 2 stops working.

45 ÷ 3 = 15. 15 ÷ 3 = 5. That is two 3s.

5 ÷ 5 = 1. One 5, and we have reached 1.

So 360 = 2³ × 3² × 5. Counting divisors from that: (3+1)(2+1)(1+1) = 24 of them.

360 = 2³ × 3² × 5

Frequently asked questions

Problems people actually run into

Stopping before the factors are fully prime

Writing 360 as 8 × 45 is a correct factorisation but not a prime one, because neither 8 nor 45 is prime.

Keep going until every number left is prime: 8 becomes 2³ and 45 becomes 3² × 5. The check is simple — if any factor can still be divided, you are not finished.

Results are estimates for general information only and are not professional financial, medical, or legal advice. Read our full disclaimer.

Last updated: September 4, 2026