What is the Greatest Common Factor of 50068 and 50082?

Greatest common factor (GCF) of 50068 and 50082 is 2.

GCF(50068,50082) = 2

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

How to find the GCF of 50068 and 50082?

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

Step-1: Prime Factorization of 50068

Prime factors of 50068 are 2, 12517. Prime factorization of 50068 in exponential form is:

50068 = 2² × 12517¹

Step-2: Prime Factorization of 50082

Prime factors of 50082 are 2, 3, 17, 491. Prime factorization of 50082 in exponential form is:

50082 = 2¹ × 3¹ × 17¹ × 491¹

Step-3: Factors of 50068

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

1, 2, 4, 12517, 25034

Step-4: Factors of 50082

List of positive integer factors of 50082 that divides 50068 without a remainder.

1, 2, 3, 6, 17, 34, 51, 102, 491, 982, 1473, 2946, 8347, 16694, 25041

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 50068 and 50082