What is the Greatest Common Factor of 63952 and 63958?

Greatest common factor (GCF) of 63952 and 63958 is 2.

GCF(63952,63958) = 2

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

How to find the GCF of 63952 and 63958?

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

Step-1: Prime Factorization of 63952

Prime factors of 63952 are 2, 7, 571. Prime factorization of 63952 in exponential form is:

63952 = 2⁴ × 7¹ × 571¹

Step-2: Prime Factorization of 63958

Prime factors of 63958 are 2, 113, 283. Prime factorization of 63958 in exponential form is:

63958 = 2¹ × 113¹ × 283¹

Step-3: Factors of 63952

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

1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 571, 1142, 2284, 3997, 4568, 7994, 9136, 15988, 31976

Step-4: Factors of 63958

List of positive integer factors of 63958 that divides 63952 without a remainder.

1, 2, 113, 226, 283, 566, 31979

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 63952 and 63958