What is the Greatest Common Factor of 56968 and 56979?

Greatest common factor (GCF) of 56968 and 56979 is 1.

GCF(56968,56979) = 1

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

How to find the GCF of 56968 and 56979?

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

Step-1: Prime Factorization of 56968

Prime factors of 56968 are 2, 7121. Prime factorization of 56968 in exponential form is:

56968 = 2³ × 7121¹

Step-2: Prime Factorization of 56979

Prime factors of 56979 are 3, 13, 487. Prime factorization of 56979 in exponential form is:

56979 = 3² × 13¹ × 487¹

Step-3: Factors of 56968

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

1, 2, 4, 8, 7121, 14242, 28484

Step-4: Factors of 56979

List of positive integer factors of 56979 that divides 56968 without a remainder.

1, 3, 9, 13, 39, 117, 487, 1461, 4383, 6331, 18993

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 56968 and 56979