What is the Greatest Common Factor of 96410 and 96415?

Greatest common factor (GCF) of 96410 and 96415 is 5.

GCF(96410,96415) = 5

We will now calculate the prime factors of 96410 and 96415, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 96410 and 96415.

How to find the GCF of 96410 and 96415?

We will first find the prime factorization of 96410 and 96415. After we will calculate the factors of 96410 and 96415 and find the biggest common factor number .

Step-1: Prime Factorization of 96410

Prime factors of 96410 are 2, 5, 31, 311. Prime factorization of 96410 in exponential form is:

96410 = 2¹ × 5¹ × 31¹ × 311¹

Step-2: Prime Factorization of 96415

Prime factors of 96415 are 5, 11, 1753. Prime factorization of 96415 in exponential form is:

96415 = 5¹ × 11¹ × 1753¹

Step-3: Factors of 96410

List of positive integer factors of 96410 that divides 96410 without a remainder.

1, 2, 5, 10, 31, 62, 155, 310, 311, 622, 1555, 3110, 9641, 19282, 48205

Step-4: Factors of 96415

List of positive integer factors of 96415 that divides 96410 without a remainder.

1, 5, 11, 55, 1753, 8765, 19283

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 96410 and 96415. The biggest common factor number is the GCF number.
So the greatest common factor 96410 and 96415 is 5.

Also check out the Least Common Multiple of 96410 and 96415