What is the Greatest Common Factor of 11962 and 11968?

Greatest common factor (GCF) of 11962 and 11968 is 2.

GCF(11962,11968) = 2

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

How to find the GCF of 11962 and 11968?

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

Step-1: Prime Factorization of 11962

Prime factors of 11962 are 2, 5981. Prime factorization of 11962 in exponential form is:

11962 = 2¹ × 5981¹

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 11962

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

1, 2, 5981

Step-4: Factors of 11968

List of positive integer factors of 11968 that divides 11962 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 11962 and 11968. The biggest common factor number is the GCF number.
So the greatest common factor 11962 and 11968 is 2.

Also check out the Least Common Multiple of 11962 and 11968