What is the Greatest Common Factor of 50052 and 50065?

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

GCF(50052,50065) = 1

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

How to find the GCF of 50052 and 50065?

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

Step-1: 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-2: Prime Factorization of 50065

Prime factors of 50065 are 5, 17, 19, 31. Prime factorization of 50065 in exponential form is:

50065 = 5¹ × 17¹ × 19¹ × 31¹

Step-3: Factors of 50052

List of positive integer factors of 50052 that divides 50052 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

Step-4: Factors of 50065

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

1, 5, 17, 19, 31, 85, 95, 155, 323, 527, 589, 1615, 2635, 2945, 10013

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 50052 and 50065