What is the Greatest Common Factor of 11253 and 11269?

Greatest common factor (GCF) of 11253 and 11269 is 1.

GCF(11253,11269) = 1

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

How to find the GCF of 11253 and 11269?

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

Step-1: Prime Factorization of 11253

Prime factors of 11253 are 3, 11, 31. Prime factorization of 11253 in exponential form is:

11253 = 3¹ × 11² × 31¹

Step-2: Prime Factorization of 11269

Prime factors of 11269 are 59, 191. Prime factorization of 11269 in exponential form is:

11269 = 59¹ × 191¹

Step-3: Factors of 11253

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

1, 3, 11, 31, 33, 93, 121, 341, 363, 1023, 3751

Step-4: Factors of 11269

List of positive integer factors of 11269 that divides 11253 without a remainder.

1, 59, 191

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11253 and 11269