Prime factorization or prime factor decomposition is the process of finding which prime numbers can be multiplied together to make the original number.
To find the prime factors, you start by dividing the number by the first prime number, which is 2. If there is not a remainder, meaning you can divide evenly, then 2 is a factor of the number. Continue dividing by 2 until you cannot divide evenly anymore. Write down how many 2's you were able to divide by evenly. Now try dividing by the next prime factor, which is 3. The goal is to get to a quotient of 1.
Here are the first several prime factors: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29...
Let's start by dividing 11,165,671 by 2
11,165,671 ÷ 2 = 5,582,835.5 - This has a remainder. Let's try another prime number.
11,165,671 ÷ 3 = 3,721,890.3333 - This has a remainder. Let's try another prime number.
11,165,671 ÷ 5 = 2,233,134.2 - This has a remainder. Let's try another prime number.
11,165,671 ÷ 11 = 1,015,061 - No remainder! 11 is one of the factors!
1,015,061 ÷ 11 = 92,278.2727 - There is a remainder. We can't divide by 11 evenly anymore. Let's try the next prime number
1,015,061 ÷ 13 = 78,081.6154 - This has a remainder. 13 is not a factor.
1,015,061 ÷ 17 = 59,709.4706 - This has a remainder. 17 is not a factor.
1,015,061 ÷ 19 = 53,424.2632 - This has a remainder. 19 is not a factor.
...
Keep trying increasingly larger numbers until you find one that divides evenly.
...
1,015,061 ÷ 1,015,061 = 1 - No remainder! 1,015,061 is one of the factors!
The orange divisor(s) above are the prime factors of the number 11,165,671. If we put all of it together we have the factors 11 x 1,015,061 = 11,165,671. It can also be written in exponential form as 111 x 1,015,0611.
Another way to do prime factorization is to use a factor tree. Below is a factor tree for the number 11,165,671.
| 11,165,671 | ||
 | ||
| 11 | 1,015,061 |
| 11,165,669 | 11,165,670 | 11,165,672 | 11,165,673 |
| 531 x 1911 x 1,1031 | 21 x 32 x 51 x 971 x 1,2791 | 23 x 71 x 231 x 8,6691 | 31 x 191 x 311 x 711 x 891 |