What is the Greatest Common Factor of 15961 and 15980?

Greatest common factor (GCF) of 15961 and 15980 is 1.

GCF(15961,15980) = 1

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

How to find the GCF of 15961 and 15980?

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

Step-1: Prime Factorization of 15961

Prime factors of 15961 are 11, 1451. Prime factorization of 15961 in exponential form is:

15961 = 11¹ × 1451¹

Step-2: Prime Factorization of 15980

Prime factors of 15980 are 2, 5, 17, 47. Prime factorization of 15980 in exponential form is:

15980 = 2² × 5¹ × 17¹ × 47¹

Step-3: Factors of 15961

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

1, 11, 1451

Step-4: Factors of 15980

List of positive integer factors of 15980 that divides 15961 without a remainder.

1, 2, 4, 5, 10, 17, 20, 34, 47, 68, 85, 94, 170, 188, 235, 340, 470, 799, 940, 1598, 3196, 3995, 7990

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15961 and 15980