What is the Greatest Common Factor of 12947 and 12958?

Greatest common factor (GCF) of 12947 and 12958 is 11.

GCF(12947,12958) = 11

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

How to find the GCF of 12947 and 12958?

We will first find the prime factorization of 12947 and 12958. After we will calculate the factors of 12947 and 12958 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 12958

Prime factors of 12958 are 2, 11, 19, 31. Prime factorization of 12958 in exponential form is:

12958 = 2¹ × 11¹ × 19¹ × 31¹

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 12958

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

1, 2, 11, 19, 22, 31, 38, 62, 209, 341, 418, 589, 682, 1178, 6479

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12947 and 12958