What is the Greatest Common Factor of 63948 and 63962?

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

GCF(63948,63962) = 2

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

How to find the GCF of 63948 and 63962?

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

Step-1: Prime Factorization of 63948

Prime factors of 63948 are 2, 3, 73. Prime factorization of 63948 in exponential form is:

63948 = 2² × 3¹ × 73²

Step-2: Prime Factorization of 63962

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

63962 = 2¹ × 31981¹

Step-3: Factors of 63948

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

1, 2, 3, 4, 6, 12, 73, 146, 219, 292, 438, 876, 5329, 10658, 15987, 21316, 31974

Step-4: Factors of 63962

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

1, 2, 31981

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 63948 and 63962