What is the Greatest Common Factor of 9669 and 9680?

Greatest common factor (GCF) of 9669 and 9680 is 11.

GCF(9669,9680) = 11

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

How to find the GCF of 9669 and 9680?

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

Step-1: Prime Factorization of 9669

Prime factors of 9669 are 3, 11, 293. Prime factorization of 9669 in exponential form is:

9669 = 3¹ × 11¹ × 293¹

Step-2: Prime Factorization of 9680

Prime factors of 9680 are 2, 5, 11. Prime factorization of 9680 in exponential form is:

9680 = 2⁴ × 5¹ × 11²

Step-3: Factors of 9669

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

1, 3, 11, 33, 293, 879, 3223

Step-4: Factors of 9680

List of positive integer factors of 9680 that divides 9669 without a remainder.

1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 40, 44, 55, 80, 88, 110, 121, 176, 220, 242, 440, 484, 605, 880, 968, 1210, 1936, 2420, 4840

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 9669 and 9680. The biggest common factor number is the GCF number.
So the greatest common factor 9669 and 9680 is 11.

Also check out the Least Common Multiple of 9669 and 9680