What is the Greatest Common Factor of 39962 and 39968?

Greatest common factor (GCF) of 39962 and 39968 is 2.

GCF(39962,39968) = 2

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

How to find the GCF of 39962 and 39968?

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

Step-1: Prime Factorization of 39962

Prime factors of 39962 are 2, 13, 29, 53. Prime factorization of 39962 in exponential form is:

39962 = 2¹ × 13¹ × 29¹ × 53¹

Step-2: Prime Factorization of 39968

Prime factors of 39968 are 2, 1249. Prime factorization of 39968 in exponential form is:

39968 = 2⁵ × 1249¹

Step-3: Factors of 39962

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

1, 2, 13, 26, 29, 53, 58, 106, 377, 689, 754, 1378, 1537, 3074, 19981

Step-4: Factors of 39968

List of positive integer factors of 39968 that divides 39962 without a remainder.

1, 2, 4, 8, 16, 32, 1249, 2498, 4996, 9992, 19984

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 39962 and 39968. The biggest common factor number is the GCF number.
So the greatest common factor 39962 and 39968 is 2.

Also check out the Least Common Multiple of 39962 and 39968