What is the Greatest Common Factor of 25961 and 25980?

Greatest common factor (GCF) of 25961 and 25980 is 1.

GCF(25961,25980) = 1

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

How to find the GCF of 25961 and 25980?

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

Step-1: Prime Factorization of 25961

Prime factors of 25961 are 13, 1997. Prime factorization of 25961 in exponential form is:

25961 = 13¹ × 1997¹

Step-2: Prime Factorization of 25980

Prime factors of 25980 are 2, 3, 5, 433. Prime factorization of 25980 in exponential form is:

25980 = 2² × 3¹ × 5¹ × 433¹

Step-3: Factors of 25961

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

1, 13, 1997

Step-4: Factors of 25980

List of positive integer factors of 25980 that divides 25961 without a remainder.

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 433, 866, 1299, 1732, 2165, 2598, 4330, 5196, 6495, 8660, 12990

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 25961 and 25980