What is the Greatest Common Factor of 11249 and 11265?

Greatest common factor (GCF) of 11249 and 11265 is 1.

GCF(11249,11265) = 1

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

How to find the GCF of 11249 and 11265?

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

Step-1: Prime Factorization of 11249

Prime factors of 11249 are 7, 1607. Prime factorization of 11249 in exponential form is:

11249 = 7¹ × 1607¹

Step-2: Prime Factorization of 11265

Prime factors of 11265 are 3, 5, 751. Prime factorization of 11265 in exponential form is:

11265 = 3¹ × 5¹ × 751¹

Step-3: Factors of 11249

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

1, 7, 1607

Step-4: Factors of 11265

List of positive integer factors of 11265 that divides 11249 without a remainder.

1, 3, 5, 15, 751, 2253, 3755

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11249 and 11265