What is the Greatest Common Factor of 99950 and 99968?

Greatest common factor (GCF) of 99950 and 99968 is 2.

GCF(99950,99968) = 2

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

How to find the GCF of 99950 and 99968?

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

Step-1: Prime Factorization of 99950

Prime factors of 99950 are 2, 5, 1999. Prime factorization of 99950 in exponential form is:

99950 = 2¹ × 5² × 1999¹

Step-2: Prime Factorization of 99968

Prime factors of 99968 are 2, 11, 71. Prime factorization of 99968 in exponential form is:

99968 = 2⁷ × 11¹ × 71¹

Step-3: Factors of 99950

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

1, 2, 5, 10, 25, 50, 1999, 3998, 9995, 19990, 49975

Step-4: Factors of 99968

List of positive integer factors of 99968 that divides 99950 without a remainder.

1, 2, 4, 8, 11, 16, 22, 32, 44, 64, 71, 88, 128, 142, 176, 284, 352, 568, 704, 781, 1136, 1408, 1562, 2272, 3124, 4544, 6248, 9088, 12496, 24992, 49984

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 99950 and 99968. The biggest common factor number is the GCF number.
So the greatest common factor 99950 and 99968 is 2.

Also check out the Least Common Multiple of 99950 and 99968