What is the Greatest Common Factor of 25801 and 25809?

Greatest common factor (GCF) of 25801 and 25809 is 1.

GCF(25801,25809) = 1

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

How to find the GCF of 25801 and 25809?

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

Step-1: Prime Factorization of 25801

Prime factors of 25801 are 25801. Prime factorization of 25801 in exponential form is:

25801 = 25801¹

Step-2: Prime Factorization of 25809

Prime factors of 25809 are 3, 7, 1229. Prime factorization of 25809 in exponential form is:

25809 = 3¹ × 7¹ × 1229¹

Step-3: Factors of 25801

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

Step-4: Factors of 25809

List of positive integer factors of 25809 that divides 25801 without a remainder.

1, 3, 7, 21, 1229, 3687, 8603

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 25801 and 25809