What is the Greatest Common Factor of 63962 and 63980?

Greatest common factor (GCF) of 63962 and 63980 is 2.

GCF(63962,63980) = 2

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

How to find the GCF of 63962 and 63980?

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

Step-1: Prime Factorization of 63962

Prime factors of 63962 are 2, 31981. Prime factorization of 63962 in exponential form is:

63962 = 2¹ × 31981¹

Step-2: Prime Factorization of 63980

Prime factors of 63980 are 2, 5, 7, 457. Prime factorization of 63980 in exponential form is:

63980 = 2² × 5¹ × 7¹ × 457¹

Step-3: Factors of 63962

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

1, 2, 31981

Step-4: Factors of 63980

List of positive integer factors of 63980 that divides 63962 without a remainder.

1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140, 457, 914, 1828, 2285, 3199, 4570, 6398, 9140, 12796, 15995, 31990

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 63962 and 63980