What is the Greatest Common Factor of 49269 and 49280?

Greatest common factor (GCF) of 49269 and 49280 is 11.

GCF(49269,49280) = 11

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

How to find the GCF of 49269 and 49280?

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

Step-1: Prime Factorization of 49269

Prime factors of 49269 are 3, 11, 1493. Prime factorization of 49269 in exponential form is:

49269 = 3¹ × 11¹ × 1493¹

Step-2: Prime Factorization of 49280

Prime factors of 49280 are 2, 5, 7, 11. Prime factorization of 49280 in exponential form is:

49280 = 2⁷ × 5¹ × 7¹ × 11¹

Step-3: Factors of 49269

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

1, 3, 11, 33, 1493, 4479, 16423

Step-4: Factors of 49280

List of positive integer factors of 49280 that divides 49269 without a remainder.

1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 20, 22, 28, 32, 35, 40, 44, 55, 56, 64, 70, 77, 80, 88, 110, 112, 128, 140, 154, 160, 176, 220, 224, 280, 308, 320, 352, 385, 440, 448, 560, 616, 640, 704, 770, 880, 896, 1120, 1232, 1408, 1540, 1760, 2240, 2464, 3080, 3520, 4480, 4928, 6160, 7040, 9856, 12320, 24640

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 49269 and 49280. The biggest common factor number is the GCF number.
So the greatest common factor 49269 and 49280 is 11.

Also check out the Least Common Multiple of 49269 and 49280