What is the Greatest Common Factor of 11258 and 11270?

Greatest common factor (GCF) of 11258 and 11270 is 2.

GCF(11258,11270) = 2

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

How to find the GCF of 11258 and 11270?

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

Step-1: Prime Factorization of 11258

Prime factors of 11258 are 2, 13, 433. Prime factorization of 11258 in exponential form is:

11258 = 2¹ × 13¹ × 433¹

Step-2: Prime Factorization of 11270

Prime factors of 11270 are 2, 5, 7, 23. Prime factorization of 11270 in exponential form is:

11270 = 2¹ × 5¹ × 7² × 23¹

Step-3: Factors of 11258

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

1, 2, 13, 26, 433, 866, 5629

Step-4: Factors of 11270

List of positive integer factors of 11270 that divides 11258 without a remainder.

1, 2, 5, 7, 10, 14, 23, 35, 46, 49, 70, 98, 115, 161, 230, 245, 322, 490, 805, 1127, 1610, 2254, 5635

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 11258 and 11270. The biggest common factor number is the GCF number.
So the greatest common factor 11258 and 11270 is 2.

Also check out the Least Common Multiple of 11258 and 11270