What is the Greatest Common Factor of 11680 and 11697?

Greatest common factor (GCF) of 11680 and 11697 is 1.

GCF(11680,11697) = 1

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

How to find the GCF of 11680 and 11697?

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

Step-1: Prime Factorization of 11680

Prime factors of 11680 are 2, 5, 73. Prime factorization of 11680 in exponential form is:

11680 = 2⁵ × 5¹ × 73¹

Step-2: Prime Factorization of 11697

Prime factors of 11697 are 3, 7, 557. Prime factorization of 11697 in exponential form is:

11697 = 3¹ × 7¹ × 557¹

Step-3: Factors of 11680

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

1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 73, 80, 146, 160, 292, 365, 584, 730, 1168, 1460, 2336, 2920, 5840

Step-4: Factors of 11697

List of positive integer factors of 11697 that divides 11680 without a remainder.

1, 3, 7, 21, 557, 1671, 3899

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 11680 and 11697. The biggest common factor number is the GCF number.
So the greatest common factor 11680 and 11697 is 1.

Also check out the Least Common Multiple of 11680 and 11697