Find the prime factorization of the number 140,246,505.
Use a factor tree to assist with solving. Take a look at our prime factorization page for additional help.
Factor Tree140,246,505 | ||||||||
3 | 46,748,835 | |||||||
3 | 15,582,945 | |||||||
3 | 5,194,315 | |||||||
5 | 1,038,863 | |||||||
7 | 148,409 | |||||||
19 | 7,811 | |||||||
73 | 107 |
The prime factorization in exponential form is: 33 x 51 x 71 x 191 x 731 x 1071
Setup the equation for determining the number of factors or divisors. The equation is:
d(n) = (a + 1)(b + 1)(c + 1)(d + 1)(e + 1)(f + 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 140,246,505 and how to find them.
Try the factor calculator.