What is the Greatest Common Factor of 59483 and 59502?

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

GCF(59483,59502) = 1

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

How to find the GCF of 59483 and 59502?

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

Step-1: Prime Factorization of 59483

Prime factors of 59483 are 17, 3499. Prime factorization of 59483 in exponential form is:

59483 = 17¹ × 3499¹

Step-2: 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-3: Factors of 59483

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

1, 17, 3499

Step-4: Factors of 59502

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 59483 and 59502