What is the Greatest Common Factor of 25980 and 25991?

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

GCF(25980,25991) = 1

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

How to find the GCF of 25980 and 25991?

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

Step-1: 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-2: Prime Factorization of 25991

Prime factors of 25991 are 7, 47, 79. Prime factorization of 25991 in exponential form is:

25991 = 7¹ × 47¹ × 79¹

Step-3: Factors of 25980

List of positive integer factors of 25980 that divides 25980 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

Step-4: Factors of 25991

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

1, 7, 47, 79, 329, 553, 3713

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 25980 and 25991