What is the Greatest Common Factor of 11959 and 11968?

Greatest common factor (GCF) of 11959 and 11968 is 1.

GCF(11959,11968) = 1

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

How to find the GCF of 11959 and 11968?

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

Step-1: Prime Factorization of 11959

Prime factors of 11959 are 11959. Prime factorization of 11959 in exponential form is:

11959 = 11959¹

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

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

Step-4: Factors of 11968

List of positive integer factors of 11968 that divides 11959 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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11959 and 11968