What is the Greatest Common Factor of 11260 and 11267?

Greatest common factor (GCF) of 11260 and 11267 is 1.

GCF(11260,11267) = 1

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

How to find the GCF of 11260 and 11267?

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

Step-1: Prime Factorization of 11260

Prime factors of 11260 are 2, 5, 563. Prime factorization of 11260 in exponential form is:

11260 = 2² × 5¹ × 563¹

Step-2: Prime Factorization of 11267

Prime factors of 11267 are 19, 593. Prime factorization of 11267 in exponential form is:

11267 = 19¹ × 593¹

Step-3: Factors of 11260

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

1, 2, 4, 5, 10, 20, 563, 1126, 2252, 2815, 5630

Step-4: Factors of 11267

List of positive integer factors of 11267 that divides 11260 without a remainder.

1, 19, 593

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11260 and 11267