What is the Greatest Common Factor of 11690 and 11699?

Greatest common factor (GCF) of 11690 and 11699 is 1.

GCF(11690,11699) = 1

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

How to find the GCF of 11690 and 11699?

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

Step-1: Prime Factorization of 11690

Prime factors of 11690 are 2, 5, 7, 167. Prime factorization of 11690 in exponential form is:

11690 = 2¹ × 5¹ × 7¹ × 167¹

Step-2: Prime Factorization of 11699

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

11699 = 11699¹

Step-3: Factors of 11690

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

1, 2, 5, 7, 10, 14, 35, 70, 167, 334, 835, 1169, 1670, 2338, 5845

Step-4: Factors of 11699

List of positive integer factors of 11699 that divides 11690 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11690 and 11699