What is the Greatest Common Factor of 13686 and 13690?

Greatest common factor (GCF) of 13686 and 13690 is 2.

GCF(13686,13690) = 2

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

How to find the GCF of 13686 and 13690?

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

Step-1: Prime Factorization of 13686

Prime factors of 13686 are 2, 3, 2281. Prime factorization of 13686 in exponential form is:

13686 = 2¹ × 3¹ × 2281¹

Step-2: Prime Factorization of 13690

Prime factors of 13690 are 2, 5, 37. Prime factorization of 13690 in exponential form is:

13690 = 2¹ × 5¹ × 37²

Step-3: Factors of 13686

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

1, 2, 3, 6, 2281, 4562, 6843

Step-4: Factors of 13690

List of positive integer factors of 13690 that divides 13686 without a remainder.

1, 2, 5, 10, 37, 74, 185, 370, 1369, 2738, 6845

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 13686 and 13690. The biggest common factor number is the GCF number.
So the greatest common factor 13686 and 13690 is 2.

Also check out the Least Common Multiple of 13686 and 13690