What is the Greatest Common Factor of 50039 and 50052?

Greatest common factor (GCF) of 50039 and 50052 is 1.

GCF(50039,50052) = 1

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

How to find the GCF of 50039 and 50052?

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

Step-1: Prime Factorization of 50039

Prime factors of 50039 are 11, 4549. Prime factorization of 50039 in exponential form is:

50039 = 11¹ × 4549¹

Step-2: Prime Factorization of 50052

Prime factors of 50052 are 2, 3, 43, 97. Prime factorization of 50052 in exponential form is:

50052 = 2² × 3¹ × 43¹ × 97¹

Step-3: Factors of 50039

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

1, 11, 4549

Step-4: Factors of 50052

List of positive integer factors of 50052 that divides 50039 without a remainder.

1, 2, 3, 4, 6, 12, 43, 86, 97, 129, 172, 194, 258, 291, 388, 516, 582, 1164, 4171, 8342, 12513, 16684, 25026

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 50039 and 50052