- How to break down numbers
Prime Factorization
The prime factorization of a number is the product of prime numbers that equals the number. You may want to refer to the following list of prime numbers less than [latex]50[/latex] as you work through this section.
[latex]2,3,5,7,11,13,17,19,23,29,31,37,41,43,47[/latex]
Prime Factorization Using the Factor Tree Method
One way to find the prime factorization of a number is to make a factor tree. We start by writing the number, and then writing it as the product of two factors. We write the factors below the number and connect them to the number with a small line segment—a “branch” of the factor tree. If a factor is prime, we circle it (like a bud on a tree), and do not factor that “branch” any further. If a factor is not prime, we repeat this process, writing it as the product of two factors and adding new branches to the tree. We continue until all the branches end with a prime. When the factor tree is complete, the circled primes give us the prime factorization.
For example, let’s find the prime factorization of [latex]36[/latex]. We can start with any factor pair such as [latex]3[/latex] and [latex]12[/latex]. We write [latex]3[/latex] and [latex]12[/latex] below [latex]36[/latex] with branches connecting them.

The factor [latex]3[/latex] is prime, so we circle it. The factor [latex]12[/latex] is composite, so we need to find its factors. Let’s use [latex]3[/latex] and [latex]4[/latex]. We write these factors on the tree under the [latex]12[/latex].

The factor [latex]3[/latex] is prime, so we circle it. The factor [latex]4[/latex] is composite, and it factors into [latex]2\cdot 2[/latex]. We write these factors under the [latex]4[/latex]. Since [latex]2[/latex] is prime, we circle both [latex]2\text{s}[/latex].

The prime factorization is the product of the circled primes. We generally write the prime factorization in order from least to greatest.
[latex]3\cdot 2\cdot 2\cdot 3[/latex]
In cases like this, where some of the prime factors are repeated, we can write prime factorization in exponential form.
[latex]\begin{array}{c}2\cdot 2\cdot 3\cdot 3\\ \\ {2}^{2}\cdot {3}^{2}\end{array}[/latex]
Note that we could have started our factor tree with any factor pair of [latex]36[/latex]. We chose [latex]12[/latex] and [latex]3[/latex], but the same result would have been the same if we had started with [latex]2[/latex] and [latex]18,4[/latex] and [latex]9[/latex], or [latex]6[/latex] and [latex]6[/latex].
How to: Find the prime factorization of a composite number using the tree method
- Find any factor pair of the given number, and use these numbers to create two branches.
- If a factor is prime, that branch is complete. Circle the prime.
- If a factor is not prime, write it as the product of a factor pair and continue the process.
- Write the composite number as the product of all the circled primes.