What is the Greatest Common Factor of 11968 and 11979?

Greatest common factor (GCF) of 11968 and 11979 is 11.

GCF(11968,11979) = 11

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

How to find the GCF of 11968 and 11979?

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

Step-1: Prime Factorization of 11968

Prime factors of 11968 are 2, 11, 17. Prime factorization of 11968 in exponential form is:

11968 = 2⁶ × 11¹ × 17¹

Step-2: Prime Factorization of 11979

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

11979 = 3² × 11³

Step-3: Factors of 11968

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

1, 2, 4, 8, 11, 16, 17, 22, 32, 34, 44, 64, 68, 88, 136, 176, 187, 272, 352, 374, 544, 704, 748, 1088, 1496, 2992, 5984

Step-4: Factors of 11979

List of positive integer factors of 11979 that divides 11968 without a remainder.

1, 3, 9, 11, 33, 99, 121, 363, 1089, 1331, 3993

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11968 and 11979