Q: What is the total or count of factors of the number 2,081,160?

 A: 128

How do I find the total factors of the number 2,081,160?

Step 1

Find the prime factorization of the number 2,081,160.

Use a factor tree to assist with solving. Take a look at our prime factorization page for additional help.

Factor Tree
2,081,160
Factor Arrows
21,040,580
Factor Arrows
2520,290
Factor Arrows
2260,145
Factor Arrows
386,715
Factor Arrows
328,905
Factor Arrows
39,635
Factor Arrows
51,927
Factor Arrows
4147

The prime factorization in exponential form is: 23 x 33 x 51 x 411 x 471

Step 2

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)

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.

2,081,160 = 23 x 33 x 51 x 411 x 471
Down Arrow
d(n) = (a + 1)(b + 1)(c + 1)(d + 1)(e + 1)
Down Arrow
d(2081160) = (3 + 1)(3 + 1)(1 + 1)(1 + 1)(1 + 1)
Down Arrow
d(2081160) = (4)(4)(2)(2)(2)
Down Arrow
d(2081160) = 128

More numbers for you to try

Take a look at the factors page to see the factors of 2,081,160 and how to find them.

Try the factor calculator.

Explore more about the number 2,081,160:


Ask a Question