What is the Greatest Common Factor of 12690 and 12698?

Greatest common factor (GCF) of 12690 and 12698 is 2.

GCF(12690,12698) = 2

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

How to find the GCF of 12690 and 12698?

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

Step-1: Prime Factorization of 12690

Prime factors of 12690 are 2, 3, 5, 47. Prime factorization of 12690 in exponential form is:

12690 = 2¹ × 3³ × 5¹ × 47¹

Step-2: Prime Factorization of 12698

Prime factors of 12698 are 2, 7, 907. Prime factorization of 12698 in exponential form is:

12698 = 2¹ × 7¹ × 907¹

Step-3: Factors of 12690

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

1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 47, 54, 90, 94, 135, 141, 235, 270, 282, 423, 470, 705, 846, 1269, 1410, 2115, 2538, 4230, 6345

Step-4: Factors of 12698

List of positive integer factors of 12698 that divides 12690 without a remainder.

1, 2, 7, 14, 907, 1814, 6349

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12690 and 12698