What is the Greatest Common Factor of 49268 and 49279?

Greatest common factor (GCF) of 49268 and 49279 is 1.

GCF(49268,49279) = 1

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

How to find the GCF of 49268 and 49279?

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

Step-1: Prime Factorization of 49268

Prime factors of 49268 are 2, 109, 113. Prime factorization of 49268 in exponential form is:

49268 = 2² × 109¹ × 113¹

Step-2: Prime Factorization of 49279

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

49279 = 49279¹

Step-3: Factors of 49268

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

1, 2, 4, 109, 113, 218, 226, 436, 452, 12317, 24634

Step-4: Factors of 49279

List of positive integer factors of 49279 that divides 49268 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49268 and 49279