What is the Greatest Common Factor of 10968 and 10979?

Greatest common factor (GCF) of 10968 and 10979 is 1.

GCF(10968,10979) = 1

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

How to find the GCF of 10968 and 10979?

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

Step-1: Prime Factorization of 10968

Prime factors of 10968 are 2, 3, 457. Prime factorization of 10968 in exponential form is:

10968 = 2³ × 3¹ × 457¹

Step-2: Prime Factorization of 10979

Prime factors of 10979 are 10979. Prime factorization of 10979 in exponential form is:

10979 = 10979¹

Step-3: Factors of 10968

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

1, 2, 3, 4, 6, 8, 12, 24, 457, 914, 1371, 1828, 2742, 3656, 5484

Step-4: Factors of 10979

List of positive integer factors of 10979 that divides 10968 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 10968 and 10979