What is the Greatest Common Factor of 11669 and 11680?

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

GCF(11669,11680) = 1

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

How to find the GCF of 11669 and 11680?

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

Step-1: Prime Factorization of 11669

Prime factors of 11669 are 7, 1667. Prime factorization of 11669 in exponential form is:

11669 = 7¹ × 1667¹

Step-2: 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-3: Factors of 11669

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

1, 7, 1667

Step-4: Factors of 11680

List of positive integer factors of 11680 that divides 11669 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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11669 and 11680