What is the Greatest Common Factor of 12947 and 12952?

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

GCF(12947,12952) = 1

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

How to find the GCF of 12947 and 12952?

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

Prime factors of 12952 are 2, 1619. Prime factorization of 12952 in exponential form is:

12952 = 2³ × 1619¹

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 12952

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

1, 2, 4, 8, 1619, 3238, 6476

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12947 and 12952