What is the Greatest Common Factor of 49252 and 49268?

Greatest common factor (GCF) of 49252 and 49268 is 4.

GCF(49252,49268) = 4

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

How to find the GCF of 49252 and 49268?

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

Step-1: Prime Factorization of 49252

Prime factors of 49252 are 2, 7, 1759. Prime factorization of 49252 in exponential form is:

49252 = 2² × 7¹ × 1759¹

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

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

1, 2, 4, 7, 14, 28, 1759, 3518, 7036, 12313, 24626

Step-4: Factors of 49268

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49252 and 49268