What is the Greatest Common Factor of 11268 and 11275?

Greatest common factor (GCF) of 11268 and 11275 is 1.

GCF(11268,11275) = 1

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

How to find the GCF of 11268 and 11275?

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

Step-1: Prime Factorization of 11268

Prime factors of 11268 are 2, 3, 313. Prime factorization of 11268 in exponential form is:

11268 = 2² × 3² × 313¹

Step-2: Prime Factorization of 11275

Prime factors of 11275 are 5, 11, 41. Prime factorization of 11275 in exponential form is:

11275 = 5² × 11¹ × 41¹

Step-3: Factors of 11268

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

1, 2, 3, 4, 6, 9, 12, 18, 36, 313, 626, 939, 1252, 1878, 2817, 3756, 5634

Step-4: Factors of 11275

List of positive integer factors of 11275 that divides 11268 without a remainder.

1, 5, 11, 25, 41, 55, 205, 275, 451, 1025, 2255

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11268 and 11275