What is the Greatest Common Factor of 59642 and 59651?

Greatest common factor (GCF) of 59642 and 59651 is 1.

GCF(59642,59651) = 1

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

How to find the GCF of 59642 and 59651?

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

Step-1: Prime Factorization of 59642

Prime factors of 59642 are 2, 11, 2711. Prime factorization of 59642 in exponential form is:

59642 = 2¹ × 11¹ × 2711¹

Step-2: Prime Factorization of 59651

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

59651 = 59651¹

Step-3: Factors of 59642

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

1, 2, 11, 22, 2711, 5422, 29821

Step-4: Factors of 59651

List of positive integer factors of 59651 that divides 59642 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 59642 and 59651