Prime factorization by the division method is a systematic technique for breaking any whole number greater than 1 into its prime factors by repeatedly dividing it by the smallest possible prime number until the quotient reaches 1. A prime number is a whole number greater than 1 whose only divisors are 1 and itself — examples include 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29 — while a composite number has at least one divisor other than 1 and itself and can therefore be split into a product of primes. The division method is the most widely taught way to perform this splitting because it requires nothing more than a pencil and paper, a working list of primes, and a willingness to keep dividing. The reason it always works is the Fundamental Theorem of Arithmetic, which guarantees that every integer greater than 1 has exactly one prime factorization, ignoring the order of the factors. That guarantee is what makes 360 always come out to 2 × 2 × 2 × 3 × 3 × 5, no matter who does the dividing or in what order.
The Division Method for Prime Factorization
The division method is a structured version of trial division: write your number at the top of a column, divide it by the smallest prime that goes into it evenly, write the quotient underneath, and repeat on the quotient until you reach 1. Because every composite number has a smallest prime factor — 2 if the number is even, and so on — the process always has somewhere to go until you eventually land on 1.
The method is sometimes called the ladder method or repeated division method because of the column layout it produces:
360 ÷ 2 = 180 180 ÷ 2 = 90 90 ÷ 2 = 45 45 ÷ 3 = 15 15 ÷ 3 = 5 5 ÷ 5 = 1The primes used as divisors on the left side — 2, 2, 2, 3, 3, 5 — are exactly the prime factors of the original number, and the order in which they appear does not matter, only the multiset does. Reading across the bottom gives the prime factorization, and grouping repeated primes with exponents gives the compact form 2³ × 3² × 5.
How to Find Prime Factorization by Division Method
Follow these concrete steps to factor any whole number greater than 1 using the division method. The example number is 84.
- Write the integer at the top of a column. Below it, draw a horizontal line. For this walkthrough the example number is 84.
- Try dividing by 2. If the number is even, 2 is a factor — write 2 to the left of the line, perform the division, and write the quotient below. 84 ÷ 2 = 42.
- Try 2 again on the new quotient. 42 ÷ 2 = 21. 21 is odd, so 2 is no longer a factor — move to the next prime.
- Try 3. 21 ÷ 3 = 7. 7 is prime, but do not stop yet — keep dividing while the quotient is still composite.
- Try the next unused prime that divides evenly. 7 ÷ 7 = 1. The quotient is now 1, so the method is finished.
- Collect the divisors used, in order: 2, 2, 3, 7. Write them as a product: 2 × 2 × 3 × 7, then convert to exponent form: 2² × 3 × 7.
A small safety rule: you can stop the column early — without ever reaching 1 — as soon as the current quotient is a prime. At that point, the remaining prime has simply been left over and still counts as a factor. For example, when factoring 39, you reach 13 ÷ 13 = 1 and stop; you would also be allowed to stop at 13, because 13 is itself prime and is the last factor.
Worked Example: Factoring 360 Step by Step
The number 360 is a useful test case because it has three different primes and one of them appears three times. Walking through the division method by hand produces the following sequence.
| Step | Dividend | Smallest Prime | Quotient |
|---|---|---|---|
| 1 | 360 | 2 | 180 |
| 2 | 180 | 2 | 90 |
| 3 | 90 | 2 | 45 |
| 4 | 45 | 3 | 15 |
| 5 | 15 | 3 | 5 |
| 6 | 5 | 5 | 1 |
Reading off the divisors gives 2, 2, 2, 3, 3, 5, so the prime factorization of 360 is 2 × 2 × 2 × 3 × 3 × 5, written compactly as 2³ × 3² × 5. The exponents count repeated factors: 2³ means three copies of 2 multiplied together, and 3² means two copies of 3 multiplied together. To check the answer, multiply the prime factors back together: 2 × 2 = 4, 4 × 2 = 8, 8 × 3 = 24, 24 × 3 = 72, 72 × 5 = 360. The product returns to the starting number, which confirms the factorization.
Why the Division Method Always Works
Two pieces of mathematics guarantee that the division method always terminates with a complete and unique factorization.
The first is the Fundamental Theorem of Arithmetic. It states that every integer greater than 1 can be written as a product of primes, and that this factorization is unique up to the order of the factors. Because the primes are unique, the same number cannot have two different prime factorizations, and the division method has to land on the only correct one.
The second is a useful shortcut: as soon as the quotient you are working with is smaller than the square of the smallest prime you would try next, you can stop. More simply, you only ever need to test primes up to the square root of the original number. For 360, the square root is about 18.97, so once you reach 5 — which is less than 19 — and divide it out to reach 1, you are done. Any leftover number that cannot be divided by any prime up to its own square root must itself be prime, which is why the leftover-prime shortcut is safe.
The number 1 has no prime factorization, because 1 is not prime and has no divisors larger than 1. Every integer greater than 1 factors cleanly. Primes themselves factor trivially: the prime factorization of 7 is just 7, the prime factorization of 97 is just 97, and the division method will report a single division step where the prime divides itself to give 1.
Skip the Long Division with a Calculator
For homework checks, classroom demonstrations, or quick sanity checks, the same division method can be automated. The Prime Factorization Calculator runs the division method in your browser and updates the result instantly as you type. It accepts any whole number greater than 1 up to 1,000,000,000,000 (one trillion), so it covers everything from classroom examples like 84 to 13-digit challenge values.
Using the calculator is the same three-step routine as doing it by hand:
- Type a whole number greater than 1 into the box, for example 360.
- Watch the prime factorization, the exponent form (2³ × 3² × 5), and the factor tree update instantly.
- Read off the prime factor list, the number of divisors, and whether the number is prime.
Because the tool uses trial division internally — dividing by 2 as many times as possible, then by 3, 5, 7, and so on, up to the square root of what remains — it is exactly the division method described above, just executed for you. A large value like 600,851,475,143, which is 71 × 839 × 1471 × 6857, still factors in well under a second. Everything runs locally in the browser, so nothing typed into the box is uploaded to a server.
Putting Prime Factors to Work
The output of the division method is useful far beyond writing a number as a product of primes. The exponent form 2^e₁ × 3^e₂ × … directly powers a handful of other calculations you may want to do next.
| Use Case | How Prime Factors Help | Quick Method |
|---|---|---|
| Number of divisors | Add 1 to each exponent, then multiply. | (e₁ + 1)(e₂ + 1)… |
| Sum of divisors | Multiply the divisor sums of each prime power. | ∏ (p^(e+1) − 1) / (p − 1) |
| Greatest common divisor (GCD) | Take each prime to the smaller of the two exponents. | min(e₁, f₁), min(e₂, f₂)… |
| Least common multiple (LCM) | Take each prime to the larger of the two exponents. | max(e₁, f₁), max(e₂, f₂)… |
| Simplify a fraction | Cancel any prime that appears in both numerator and denominator. | Divide top and bottom by the GCD. |
For 360 = 2³ × 3² × 5, the number of divisors is (3+1)(2+1)(1+1) = 4 × 3 × 2 = 24, the sum of divisors is (1+2+4+8) × (1+3+9) × (1+5) = 15 × 13 × 6 = 1170, and the 24 divisors themselves can be listed by combining each choice of exponent. The Prime Factorization Calculator returns these numbers alongside the prime factors, so you can grab them without re-doing the arithmetic. Once you have prime factorizations for two numbers, a GCF Calculator or LCM Calculator finishes the job, and for the deeper math behind those operations, the How to Calculate GCF Using Prime Factorization guide walks through the same min/max-exponent idea with extra examples.
The division method is also the conceptual doorway to larger topics: it is the inverse of multiplication for integers, the building block for modular arithmetic, and the foundation that makes modern cryptography such as RSA secure, because the difficulty of factoring very large numbers keeps the private key hidden.
Try the division method on a few small numbers by hand first, then verify each one with the Prime Factorization Calculator to build confidence in the technique.
For a deeper look, see How to Find Prime Numbers Between 100 and 200.