Find the prime factorization of the number 131,424,000.
Use a factor tree to assist with solving. Take a look at our prime factorization page for additional help.
Factor Tree131,424,000 | ||||||||||||||
2 | 65,712,000 | |||||||||||||
2 | 32,856,000 | |||||||||||||
2 | 16,428,000 | |||||||||||||
2 | 8,214,000 | |||||||||||||
2 | 4,107,000 | |||||||||||||
2 | 2,053,500 | |||||||||||||
2 | 1,026,750 | |||||||||||||
2 | 513,375 | |||||||||||||
3 | 171,125 | |||||||||||||
5 | 34,225 | |||||||||||||
5 | 6,845 | |||||||||||||
5 | 1,369 | |||||||||||||
37 | 37 |
The prime factorization in exponential form is: 28 x 31 x 53 x 372
Setup the equation for determining the number of factors or divisors. The equation is:
d(n) = (a + 1)(b + 1)(c + 1)(d + 1)
Where d(n) is equal to the number of divisors of the number and a, b, etc. are equal to the exponents of the prime factorization.
Now substitute the letters in the equation with the the exponents of your prime factorization and then solve to calculate the total number of divisors.
Take a look at the factors page to see the factors of 131,424,000 and how to find them.
Try the factor calculator.