Prime Factorization Calculator

A prime factorization calculator breaks a whole number into the unique set of prime numbers that multiply to make it. Enter 360 and it returns 2³ × 3² × 5 in exponent form, lists all 24 factors, counts them, and confirms whether the number is prime or composite, with every division step shown so it works as a learning tool, not just an answer machine.

What prime factorization means

A prime number is a whole number greater than 1 whose only divisors are 1 and itself: 2, 3, 5, 7, 11, 13, and so on. A composite number can be broken down into smaller factors. Prime factorization is the process of writing any integer greater than 1 as a product of primes. The result is guaranteed to be unique by the Fundamental Theorem of Arithmetic: no matter how you split the number, you always arrive at the same prime factors.

Here each p is a distinct prime and each a is the exponent counting how many times that prime appears. For 360, that is 2³ × 3² × 5¹.

A worked example: factoring 360

Watch the trial-division method in action:

• 360 ÷ 2 = 180
• 180 ÷ 2 = 90
• 90 ÷ 2 = 45  (2 no longer divides evenly, move to 3)
• 45 ÷ 3 = 15
• 15 ÷ 3 = 5  (3 no longer divides, move up)
• 5 ÷ 5 = 1  (quotient reaches 1, so you are done)

Collecting the divisors: 2 appeared three times, 3 appeared twice, and 5 once, giving 2³ × 3² × 5 = 360.

How to use this calculator

1. Enter a whole number of 2 or greater in the input box (or tap one of the example chips).
2. Read the headline factorization in exponent form: the big number at the top is your answer.
3. Check the prime/composite badge directly underneath to see whether the number is prime.
4. Follow the factor tree to see exactly which prime split off at each stage (360 = 2 × 180, 180 = 2 × 90, and so on).
5. Scan the full list of factors at the bottom for every divisor of the number.

The result updates instantly as you type; there is no button to press. A thousands separator such as 1,000,000 is fine. Decimals and fractions get a friendly message, because prime factorization is only defined for positive integers, and a negative number is shown as −1 times the factorization of its absolute value.

Who this calculator is for

• Students checking homework on factors, factor trees, GCF, and LCM.
• Teachers and tutors who want a clean step-by-step example to walk through.
• Parents helping with middle-school or early high-school math.
• Programmers and puzzlers who need a quick factorization or a primality check.
• Anyone curious whether a number is prime or how it is built.

Key terms explained

• Prime number: an integer greater than 1 divisible only by 1 and itself (2, 3, 5, 7, 11…).
• Composite number: an integer greater than 1 that has factors besides 1 and itself.
• Factor (divisor): any whole number that divides the value with no remainder.
• Exponent form: grouping repeated primes as powers, e.g. 2³ instead of 2 × 2 × 2.
• Factor tree: a diagram that repeatedly splits a number until every branch ends in a prime.
• Trial division: the method of testing small primes in turn to peel off factors.

Prime vs. composite: how to tell the difference

Every whole number greater than 1 is either prime or composite; there is no third option, and 1 itself is neither. A prime has exactly two divisors (1 and itself), so it cannot be broken down any further; it is already its own factorization. A composite number has at least one divisor other than 1 and itself, which means it can always be written as a product of smaller primes. When you ask "is this number prime?", you are really asking "does any prime up to its square root divide it evenly?" If the answer is no, the number is prime. For small numbers this calculator runs exactly that test (for very large ones it uses the faster Miller-Rabin test) and shows the verdict as a colored badge, so you never have to guess.

A common point of confusion is that small numbers feel "obviously" prime or composite, while larger ones are harder to judge by eye. For instance, 51 looks prime but is actually 3 × 17, and 91 looks prime but is 7 × 13. Trial division removes the guesswork by mechanically testing each prime in turn.

The first prime numbers

It helps to recognize the small primes on sight, because trial division always tests them first. Here are the first 25 prime numbers (every prime below 100):

Notice that after 2, every prime is odd, because any even number larger than 2 is divisible by 2 and therefore composite. Notice too that primes thin out as numbers grow: there are 4 primes below 10, but only 21 between 100 and 200. They never run out, though: Euclid proved over two thousand years ago that there are infinitely many primes. If you need a quick primality check rather than a full factorization, simply enter the number and read the badge; a prime returns a factorization equal to itself.

How trial division works, step by step

The method behind this tool is the same one taught in school, just automated. Given a number N, it does the following:

1. Divide out every 2. While N is even, divide by 2 and record a factor of 2. This strips out the only even prime first.
2. Try odd numbers from 3 upward. Test 3, 5, 7, 9, 11… (the calculator skips even candidates because their 2s are already gone). Whenever one divides N evenly, record it and divide again with the same candidate until it no longer fits.
3. Stop at the square root. Once the candidate is larger than the square root of what is left, no smaller factor remains to be found.
4. Handle the leftover. If anything greater than 1 remains, it is itself a prime and becomes the final factor.
5. Group into exponent form. Repeated primes are collapsed into powers for a clean answer.

This is fast for everyday numbers because most have at least one small prime factor that peels away quickly. It only slows down on large primes or "semiprimes" (a product of two big primes), where every candidate up to the square root must be tested; that slowness is the very property that makes factoring useful in cryptography. To stay instant on such inputs, the calculator stops trial division at 100,000 and checks any larger leftover with the Miller-Rabin primality test, splitting it with Pollard's rho method when it is not prime. The factors are the same; they are just found faster.

More worked examples

Example 1, a prime number (97): Trial division tries 2, 3, 5, and 7 (the primes up to √97 ≈ 9.8) and none divide evenly. With nothing left to divide, 97 is itself prime, so its factorization is just 97 and its only factors are 1 and 97.

Example 2, a power of two (1,024): Dividing by 2 repeatedly gives 512, 256, 128, 64, 32, 16, 8, 4, 2, 1: ten divisions in all. So 1,024 = 2¹⁰, a perfect example of a number with a single prime factor raised to a high power. It has 11 factors (the powers of 2 from 2⁰ to 2¹⁰).

Example 3, a year (2,024): 2,024 ÷ 2 = 1,012, ÷ 2 = 506, ÷ 2 = 253; then 253 ÷ 11 = 23, and 23 is prime. So 2,024 = 2³ × 11 × 23. Counting divisors: (3+1)(1+1)(1+1) = 16 factors.

Step-by-step: prime factorization of 504

This trace shows exactly how the calculator peels one prime off at a time. Each row divides the current value by the smallest prime that fits, until the quotient reaches a prime you cannot divide further.

Grouping the repeats gives 504 = 2³ × 3² × 7, with (3+1)(2+1)(1+1) = 24 factors.

Quick reference: factorizations of common numbers

A handy table of prime factorizations and factor counts for numbers people look up often:

Prime factorization of every number from 2 to 60

The full chart below gives the prime factorization, divisor count, and prime-or-composite verdict for every integer from 2 to 60, the numbers that come up most in homework. Values are computed by the same trial-division method the calculator uses.

Of these 59 numbers, 17 are prime (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59) and the remaining 42 are composite. Highly composite values like 48 (10 factors) and 60 (12 factors, the most in the chart) pack the most divisors, which makes 60 easy to split into halves, thirds, quarters, fifths and sixths for minutes, seconds and degrees.

Divisibility rules cheat sheet

When you factor by hand, divisibility rules let you spot a prime factor without doing the full division. These shortcuts test the small primes that trial division tries first:

There is no simple rule for 7, so trial division just tests it directly. The rules for 2, 3, and 5 are the workhorses: between them they peel off the factors of the vast majority of numbers you will meet in homework.

Counting factors from the factorization

You do not have to list divisors one by one to count them. Take each exponent, add 1, and multiply the results. For 360 = 2³ × 3² × 5¹, the divisor count is (3+1) × (2+1) × (1+1) = 4 × 3 × 2 = 24. The calculator shows the full list so you can verify it, but the formula is the fast way to do it by hand.

Using prime factors for GCF and LCM

Prime factorization is the backbone of two common school tasks. For the greatest common factor (GCF) of two numbers, factor both and multiply each shared prime raised to its lowest power. For the least common multiple (LCM), take every prime that appears in either number raised to its highest power. For example, 12 = 2² × 3 and 18 = 2 × 3²: the GCF is 2 × 3 = 6, and the LCM is 2² × 3² = 36.

A neat shortcut ties the two together: for any pair of numbers, GCF × LCM = the product of the numbers themselves. For 12 and 18 that is 6 × 36 = 216 = 12 × 18. If you want the answer worked out for you, factor each number here first, then run the pair through the dedicated GCF Calculator or LCM Calculator to confirm. The same prime breakdown is also what powers the Fraction Calculator when it reduces a fraction to lowest terms.

The table below reads the GCF and LCM straight off the prime factorizations of common number pairs. Notice the identity in the last column: GCF × LCM always equals the product of the two numbers.

Where prime factorization is used in the real world

Prime factorization is not just a classroom exercise; it sits underneath several everyday and high-stakes applications:

• Simplifying fractions: cancelling the prime factors shared by the numerator and denominator is exactly how a fraction is reduced to lowest terms.
• Scheduling and timing: the LCM (built from prime factors) tells you when two repeating events line up again, for example when two buses on different cycles next leave together.
• Square roots: a number is a perfect square only when every prime in its factorization has an even exponent, which is how you simplify a radical like √72 = √(2³ × 3²) = 6√2. The Square Root Calculator uses the same idea.
• Cryptography: RSA encryption multiplies two enormous primes together; the security rests on the fact that factoring the product back into those primes is practically impossible for current computers.
• Computer science: hashing, pseudo-random number generators, and error-correcting codes all lean on properties of primes and factorization.

Answers to the numbers people ask about

Some specific numbers come up again and again. Here is the quick truth on each:

• Is 0 prime? No. Zero is divisible by every number, so it is neither prime nor composite and has no factorization.
• Is 1 prime? No, it has only one divisor. It is neither prime nor composite.
• Is 2 prime? Yes, and it is the only even prime; every other even number is divisible by 2.
• Is 9 prime? No, 9 = 3². A number ending in 9 is not automatically prime.
• Is 51 prime? No, 51 = 3 × 17, a classic "looks prime but isn't" example.
• Is 97 prime? Yes, 97 is the largest prime below 100.

Tips for factoring by hand

• Always start at 2. If the number is even, keep halving until it is odd.
• Use divisibility rules. A number is divisible by 3 if its digits sum to a multiple of 3, and by 5 if it ends in 0 or 5.
• Skip even divisors once you have removed all the 2s; only odd primes can remain.
• Stop at the square root. If no prime up to √N divides the leftover, the leftover is prime.
• Group repeats as exponents at the end to write the answer cleanly.

How this compares to related calculators

This page answers "what are the prime factors of this number?" If your question is slightly different, a sister tool fits better:

• To find the largest factor two numbers share, use the GCF Calculator; for the smallest common multiple, use the LCM Calculator.
• To reduce or combine fractions using shared factors, use the Fraction Calculator.
• To simplify a radical from its factorization, use the Radical Calculator or the Square Root Calculator, and to raise primes to powers, the Exponent Calculator.
• For n! (the product of all integers up to n, which has its own dense factorization), use the Factorial Calculator.
• To see the full worked steps of a single division, use the Long Division Calculator.

All of these build on the same foundation: every integer is, at heart, a unique product of primes. Once you can factor a number, the rest of arithmetic gets a lot easier. To check one number's remainder against another without factoring at all, the Modulo Calculator is the quickest route.

Sources

• NIST Digital Library of Mathematical Functions, §27.2 Functions: the fundamental theorem of arithmetic (every integer n > 1 is uniquely a product of prime powers) and the divisor function d(n), the number of divisors of n.
• Euclid's Elements, Book IX, Proposition 20: prime numbers are more than any assigned multitude of prime numbers (there are infinitely many primes).
• Common Core State Standards for Mathematics: 4.OA.B.4 (factor pairs, and whether a whole number from 1 to 100 is prime or composite) and 6.NS.B.4 (greatest common factor and least common multiple).