What is the Greatest Common Factor of 59502 and 59509?

Greatest common factor (GCF) of 59502 and 59509 is 1.

GCF(59502,59509) = 1

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

How to find the GCF of 59502 and 59509?

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

Step-1: Prime Factorization of 59502

Prime factors of 59502 are 2, 3, 47, 211. Prime factorization of 59502 in exponential form is:

59502 = 2¹ × 3¹ × 47¹ × 211¹

Step-2: Prime Factorization of 59509

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

59509 = 59509¹

Step-3: Factors of 59502

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

1, 2, 3, 6, 47, 94, 141, 211, 282, 422, 633, 1266, 9917, 19834, 29751

Step-4: Factors of 59509

List of positive integer factors of 59509 that divides 59502 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 59502 and 59509