Prime factorization has two standard hand methods — the factor tree and the ladder — and most explanations show one on one number and leave you to trust that they agree. This guide works the numbers people actually search both ways, side by side, so you can watch the tree and the ladder land on the same answer every time.

The two methods in brief

A factor tree starts from the top: split the number into any two factors, then split each composite factor again, and keep going until every branch ends in a prime. The primes at the ends — the leaves — are the prime factorization. A ladder starts from the bottom: divide the number by the smallest prime that fits, divide the answer by the smallest prime that fits it, and repeat until the answer is 1. The divisors you used, read in order, are the prime factorization. Same primes either way — the fundamental theorem of arithmetic guarantees the breakdown is unique, so the two methods are really two orders of doing the same divisions. The Factor Calculator runs the ladder internally; here is what it looks like on paper.

Prime factorization of 10, both ways

The most searched of all: what is the prime factorization of 10? The tree is as short as a tree can be — 10 splits into 2 × 5, and both branches are already prime, so the tree stops after one split. The ladder is equally short: 10 ÷ 2 = 5, then 5 ÷ 5 = 1. Either way the answer is the same single line: 10 = 2 × 5. Two distinct primes, no exponents needed — 10 is the product of the first and third primes, and every multiple of 10 inherits both.

Prime factorization of 13: when the number is already prime

The prime factorization of 13 is the case that confuses people, because there is almost nothing to do: 13 is prime, so its prime factorization is 13 itself. The tree has one node and no splits. The ladder shows why it stops: you only test primes up to √13 ≈ 3.6, which means 2 and 3; 13 ÷ 2 leaves a remainder and 13 ÷ 3 leaves a remainder, so no divisor is ever written down and the number stands as its own factorization. Any prime behaves identically — 2, 5, 23, 97 — and recognising that “the number itself” is a complete, correct answer is the whole lesson of this example.

A bigger one both ways: 72

72 has enough structure to make the methods interesting. Tree: start with 72 = 8 × 9. The 8 splits 8 = 2 × 4, then 4 = 2 × 2. The 9 splits 9 = 3 × 3. The leaves are 2, 2, 2, 3, 3. Ladder: 72 ÷ 2 = 36; 36 ÷ 2 = 18; 18 ÷ 2 = 9; 9 ÷ 3 = 3; 3 ÷ 3 = 1 — divisors 2, 2, 2, 3, 3. Same five primes, as promised. Collected with exponents: 72 = 2³ × 3². A different first split changes nothing: 72 = 6 × 12 gives (2 × 3) × (2 × 2 × 3), the same leaves in a different order — the tree’s shape is yours to choose, its leaves are not.

And 100, the square

Tree: 100 = 10 × 10, and each 10 is 2 × 5, so the leaves are 2, 5, 2, 5. Ladder: 100 ÷ 2 = 50; 50 ÷ 2 = 25; 25 ÷ 5 = 5; 5 ÷ 5 = 1 — divisors 2, 2, 5, 5. Collected: 100 = 2² × 5². Squares make tidy trees because the two halves mirror each other, and tidy exponents: every prime in a perfect square carries an even exponent, which is also a quick test — if any exponent in a factorization is odd, the number is not a square.

How to write prime factorization so it can be checked

How to write prime factorization comes down to three habits. Expand or collect, but say which: “write as a product of prime factors” asks for the expanded string — 60 as 2 × 2 × 3 × 5 — while the collected form 2² × 3 × 5 is the same answer with exponents; both are correct, and the expanded one is what the phrase literally requests. Order the primes smallest first: it makes two people’s answers comparable at a glance. Multiply back: the primes must rebuild the number exactly — 2² × 3 × 5 = 4 × 3 × 5 = 60. If the product is wrong, a divisor was dropped or a composite slipped in as a “prime” (the classic is 9 or 15 written as a leaf); no other check is needed, because a factorization that multiplies back and contains only primes is the unique one.

Two more, at working size: 36 and 360

36, the small square. Tree: 36 = 6 × 6, and each 6 is 2 × 3, so the leaves are 2, 3, 2, 3. Ladder: 36 ÷ 2 = 18; 18 ÷ 2 = 9; 9 ÷ 3 = 3; 3 ÷ 3 = 1 — divisors 2, 2, 3, 3. Both give 36 = 2² × 3². The mirrored tree is the square’s signature again: identical halves, even exponents.

360, the big one. Tree: 360 = 36 × 10; the 36 breaks as above into 2, 2, 3, 3 and the 10 into 2, 5 — leaves 2, 2, 2, 3, 3, 5. Ladder: 360 ÷ 2 = 180; 180 ÷ 2 = 90; 90 ÷ 2 = 45; 45 ÷ 3 = 15; 15 ÷ 3 = 5; 5 ÷ 5 = 1 — divisors 2, 2, 2, 3, 3, 5. Both give 360 = 2³ × 3² × 5. Six ladder steps for a number with 24 factors: the ladder’s length is the total number of prime factors counted with repetition, never more, which is why it stays practical long after the tree gets wide.

240, where the tree gets wide. Tree: 240 = 24 × 10; the 24 splits 24 = 8 × 3 and the 8 splits 8 = 2 × 4 = 2 × (2 × 2), while the 10 is 2 × 5 — leaves 2, 2, 2, 3, 2, 5. Ladder: 240 ÷ 2 = 120; 120 ÷ 2 = 60; 60 ÷ 2 = 30; 30 ÷ 2 = 15; 15 ÷ 3 = 5; 5 ÷ 5 = 1 — divisors 2, 2, 2, 2, 3, 5. Both give 240 = 2⁴ × 3 × 5, and 240 is a good size to feel the practical difference between the methods: the tree needs care to keep its branches straight, while the ladder is six identical-motion divisions. Past a few hundred, most people who factor by hand switch to the ladder and keep the tree for teaching — the answers, as always, are the same.

Does the order of splitting matter?

For the tree, no — and the 72 example above already showed a second split (6 × 12) reaching the same leaves as the first (8 × 9). Any split of any branch, in any order, ends at the same multiset of primes; that is the uniqueness theorem wearing work clothes. For the ladder, the order is fixed by the method — smallest prime first — and the fixity is a feature: two people laddering the same number produce byte-identical working, so a teacher (or a reader checking this page) can follow step for step. Where order does matter is efficiency, not correctness: on paper, splitting off round factors first (72 = 8 × 9 rather than 72 = 2 × 36) keeps the tree shallow, and laddering by 2s first works because half of everything is even. Choose splits for convenience; the primes at the end are already decided.

One worked failure is worth more than the rule. Take 84 and stop too early: 84 = 4 × 21, “leaves” 4 and 21. Multiplying back gives 84, so the product check passes — but 4 and 21 are not prime, so the answer is not a prime factorization at all. Finish both branches — 4 = 2 × 2 and 21 = 3 × 7 — and the true answer appears: 84 = 2² × 3 × 7, which the ladder confirms in four steps (84 ÷ 2 = 42, 42 ÷ 2 = 21, 21 ÷ 3 = 7, 7 ÷ 7 = 1). The multiply-back check catches dropped primes; only the “is every leaf prime?” check catches this one.

Every ladder above divides by the smallest prime that fits, in order; the divisors, collected with exponents, give the prime factorization in the last column.

One last pattern from the table: the count of a number’s factors is hiding in its exponents — add 1 to each and multiply. For 360 = 2³ × 3² × 5 that is 4 × 3 × 2 = 24 factors, and the Factor Calculator confirms exactly 24. Tree, ladder and count all come from the same five-or-fewer primes.

Method: all factorizations were produced by the ladder (repeated division by the smallest fitting prime) and independently re-verified with a symbolic factorization and a multiply-back check.