What is the Greatest Common Factor of 49239 and 49258?

Greatest common factor (GCF) of 49239 and 49258 is 1.

GCF(49239,49258) = 1

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

How to find the GCF of 49239 and 49258?

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

Step-1: Prime Factorization of 49239

Prime factors of 49239 are 3, 5471. Prime factorization of 49239 in exponential form is:

49239 = 3² × 5471¹

Step-2: Prime Factorization of 49258

Prime factors of 49258 are 2, 11, 2239. Prime factorization of 49258 in exponential form is:

49258 = 2¹ × 11¹ × 2239¹

Step-3: Factors of 49239

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

1, 3, 9, 5471, 16413

Step-4: Factors of 49258

List of positive integer factors of 49258 that divides 49239 without a remainder.

1, 2, 11, 22, 2239, 4478, 24629

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49239 and 49258