What is the Greatest Common Factor of 15968 and 15979?

Greatest common factor (GCF) of 15968 and 15979 is 1.

GCF(15968,15979) = 1

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

How to find the GCF of 15968 and 15979?

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

Step-1: Prime Factorization of 15968

Prime factors of 15968 are 2, 499. Prime factorization of 15968 in exponential form is:

15968 = 2⁵ × 499¹

Step-2: Prime Factorization of 15979

Prime factors of 15979 are 19, 29. Prime factorization of 15979 in exponential form is:

15979 = 19¹ × 29²

Step-3: Factors of 15968

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

1, 2, 4, 8, 16, 32, 499, 998, 1996, 3992, 7984

Step-4: Factors of 15979

List of positive integer factors of 15979 that divides 15968 without a remainder.

1, 19, 29, 551, 841

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15968 and 15979