What is the Greatest Common Factor of 12947 and 12964?

Greatest common factor (GCF) of 12947 and 12964 is 1.

GCF(12947,12964) = 1

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

How to find the GCF of 12947 and 12964?

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

Step-1: Prime Factorization of 12947

Prime factors of 12947 are 11, 107. Prime factorization of 12947 in exponential form is:

12947 = 11² × 107¹

Step-2: Prime Factorization of 12964

Prime factors of 12964 are 2, 7, 463. Prime factorization of 12964 in exponential form is:

12964 = 2² × 7¹ × 463¹

Step-3: Factors of 12947

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

1, 11, 107, 121, 1177

Step-4: Factors of 12964

List of positive integer factors of 12964 that divides 12947 without a remainder.

1, 2, 4, 7, 14, 28, 463, 926, 1852, 3241, 6482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12947 and 12964