What is the Greatest Common Factor of 11687 and 11695?

Greatest common factor (GCF) of 11687 and 11695 is 1.

GCF(11687,11695) = 1

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

How to find the GCF of 11687 and 11695?

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

Step-1: Prime Factorization of 11687

Prime factors of 11687 are 13, 29, 31. Prime factorization of 11687 in exponential form is:

11687 = 13¹ × 29¹ × 31¹

Step-2: Prime Factorization of 11695

Prime factors of 11695 are 5, 2339. Prime factorization of 11695 in exponential form is:

11695 = 5¹ × 2339¹

Step-3: Factors of 11687

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

1, 13, 29, 31, 377, 403, 899

Step-4: Factors of 11695

List of positive integer factors of 11695 that divides 11687 without a remainder.

1, 5, 2339

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11687 and 11695