What is the Greatest Common Factor of 15964 and 15979?

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

GCF(15964,15979) = 1

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

How to find the GCF of 15964 and 15979?

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

Step-1: Prime Factorization of 15964

Prime factors of 15964 are 2, 13, 307. Prime factorization of 15964 in exponential form is:

15964 = 2² × 13¹ × 307¹

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 15964

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

1, 2, 4, 13, 26, 52, 307, 614, 1228, 3991, 7982

Step-4: Factors of 15979

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

1, 19, 29, 551, 841

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15964 and 15979