What is the Greatest Common Factor of 11252 and 11266?

Greatest common factor (GCF) of 11252 and 11266 is 2.

GCF(11252,11266) = 2

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

How to find the GCF of 11252 and 11266?

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

Step-1: Prime Factorization of 11252

Prime factors of 11252 are 2, 29, 97. Prime factorization of 11252 in exponential form is:

11252 = 2² × 29¹ × 97¹

Step-2: Prime Factorization of 11266

Prime factors of 11266 are 2, 43, 131. Prime factorization of 11266 in exponential form is:

11266 = 2¹ × 43¹ × 131¹

Step-3: Factors of 11252

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

1, 2, 4, 29, 58, 97, 116, 194, 388, 2813, 5626

Step-4: Factors of 11266

List of positive integer factors of 11266 that divides 11252 without a remainder.

1, 2, 43, 86, 131, 262, 5633

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11252 and 11266