What is the Greatest Common Factor of 12951 and 12968?

Greatest common factor (GCF) of 12951 and 12968 is 1.

GCF(12951,12968) = 1

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

How to find the GCF of 12951 and 12968?

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

Step-1: Prime Factorization of 12951

Prime factors of 12951 are 3, 1439. Prime factorization of 12951 in exponential form is:

12951 = 3² × 1439¹

Step-2: Prime Factorization of 12968

Prime factors of 12968 are 2, 1621. Prime factorization of 12968 in exponential form is:

12968 = 2³ × 1621¹

Step-3: Factors of 12951

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

1, 3, 9, 1439, 4317

Step-4: Factors of 12968

List of positive integer factors of 12968 that divides 12951 without a remainder.

1, 2, 4, 8, 1621, 3242, 6484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12951 and 12968