What is the Greatest Common Factor of 11141 and 11155?

Greatest common factor (GCF) of 11141 and 11155 is 1.

GCF(11141,11155) = 1

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

How to find the GCF of 11141 and 11155?

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

Step-1: Prime Factorization of 11141

Prime factors of 11141 are 13, 857. Prime factorization of 11141 in exponential form is:

11141 = 13¹ × 857¹

Step-2: Prime Factorization of 11155

Prime factors of 11155 are 5, 23, 97. Prime factorization of 11155 in exponential form is:

11155 = 5¹ × 23¹ × 97¹

Step-3: Factors of 11141

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

1, 13, 857

Step-4: Factors of 11155

List of positive integer factors of 11155 that divides 11141 without a remainder.

1, 5, 23, 97, 115, 485, 2231

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11141 and 11155