What is the Greatest Common Factor of 11159 and 11167?

Greatest common factor (GCF) of 11159 and 11167 is 1.

GCF(11159,11167) = 1

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

How to find the GCF of 11159 and 11167?

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

Step-1: Prime Factorization of 11159

Prime factors of 11159 are 11159. Prime factorization of 11159 in exponential form is:

11159 = 11159¹

Step-2: Prime Factorization of 11167

Prime factors of 11167 are 13, 859. Prime factorization of 11167 in exponential form is:

11167 = 13¹ × 859¹

Step-3: Factors of 11159

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

Step-4: Factors of 11167

List of positive integer factors of 11167 that divides 11159 without a remainder.

1, 13, 859

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11159 and 11167