What is the Greatest Common Factor of 49502 and 49509?

Greatest common factor (GCF) of 49502 and 49509 is 1.

GCF(49502,49509) = 1

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

How to find the GCF of 49502 and 49509?

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

Step-1: Prime Factorization of 49502

Prime factors of 49502 are 2, 53, 467. Prime factorization of 49502 in exponential form is:

49502 = 2¹ × 53¹ × 467¹

Step-2: Prime Factorization of 49509

Prime factors of 49509 are 3, 5501. Prime factorization of 49509 in exponential form is:

49509 = 3² × 5501¹

Step-3: Factors of 49502

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

1, 2, 53, 106, 467, 934, 24751

Step-4: Factors of 49509

List of positive integer factors of 49509 that divides 49502 without a remainder.

1, 3, 9, 5501, 16503

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49502 and 49509