Q: What is the total or count of factors of the number 680,169?

A: 16

How do I find the total factors of the number 680,169?

Step 1

Find the prime factorization of the number 680,169.

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

Factor Tree

	680,169

3		226,723

	7		32,389

		7		4,627

			7		661

The prime factorization in exponential form is: 3¹ x 7³ x 661¹

Step 2

Setup the equation for determining the number of factors or divisors. The equation is:

d(n) = (a + 1)(b + 1)(c + 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.

680,169 = 3¹ x 7³ x 661¹

d(n) = (a + 1)(b + 1)(c + 1)

d(680169) = (1 + 1)(3 + 1)(1 + 1)

d(680169) = (2)(4)(2)

d(680169) = 16

More numbers for you to try

Take a look at the factors page to see the factors of 680,169 and how to find them.

Try the factor calculator.

Explore more about the number 680,169:

General Questions

Factoring Questions

Calculation Questions