What is the Greatest Common Factor of 25551 and 25558?

Greatest common factor (GCF) of 25551 and 25558 is 1.

GCF(25551,25558) = 1

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

How to find the GCF of 25551 and 25558?

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

Step-1: Prime Factorization of 25551

Prime factors of 25551 are 3, 17, 167. Prime factorization of 25551 in exponential form is:

25551 = 3² × 17¹ × 167¹

Step-2: Prime Factorization of 25558

Prime factors of 25558 are 2, 13, 983. Prime factorization of 25558 in exponential form is:

25558 = 2¹ × 13¹ × 983¹

Step-3: Factors of 25551

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

1, 3, 9, 17, 51, 153, 167, 501, 1503, 2839, 8517

Step-4: Factors of 25558

List of positive integer factors of 25558 that divides 25551 without a remainder.

1, 2, 13, 26, 983, 1966, 12779

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 25551 and 25558