What is the Greatest Common Factor of 59268 and 59275?

Greatest common factor (GCF) of 59268 and 59275 is 1.

GCF(59268,59275) = 1

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

How to find the GCF of 59268 and 59275?

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

Step-1: Prime Factorization of 59268

Prime factors of 59268 are 2, 3, 11, 449. Prime factorization of 59268 in exponential form is:

59268 = 2² × 3¹ × 11¹ × 449¹

Step-2: Prime Factorization of 59275

Prime factors of 59275 are 5, 2371. Prime factorization of 59275 in exponential form is:

59275 = 5² × 2371¹

Step-3: Factors of 59268

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

1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132, 449, 898, 1347, 1796, 2694, 4939, 5388, 9878, 14817, 19756, 29634

Step-4: Factors of 59275

List of positive integer factors of 59275 that divides 59268 without a remainder.

1, 5, 25, 2371, 11855

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 59268 and 59275