What is the Greatest Common Factor of 63947 and 63952?

Greatest common factor (GCF) of 63947 and 63952 is 1.

GCF(63947,63952) = 1

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

How to find the GCF of 63947 and 63952?

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

Step-1: Prime Factorization of 63947

Prime factors of 63947 are 13, 4919. Prime factorization of 63947 in exponential form is:

63947 = 13¹ × 4919¹

Step-2: 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-3: Factors of 63947

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

1, 13, 4919

Step-4: Factors of 63952

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 63947 and 63952