What is the Greatest Common Factor of 13690 and 13698?

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

GCF(13690,13698) = 2

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

How to find the GCF of 13690 and 13698?

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

Step-1: 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-2: Prime Factorization of 13698

Prime factors of 13698 are 2, 3, 761. Prime factorization of 13698 in exponential form is:

13698 = 2¹ × 3² × 761¹

Step-3: Factors of 13690

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

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

Step-4: Factors of 13698

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

1, 2, 3, 6, 9, 18, 761, 1522, 2283, 4566, 6849

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13690 and 13698