What is the Greatest Common Factor of 14751 and 14770?

Greatest common factor (GCF) of 14751 and 14770 is 1.

GCF(14751,14770) = 1

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

How to find the GCF of 14751 and 14770?

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

Step-1: Prime Factorization of 14751

Prime factors of 14751 are 3, 11, 149. Prime factorization of 14751 in exponential form is:

14751 = 3² × 11¹ × 149¹

Step-2: Prime Factorization of 14770

Prime factors of 14770 are 2, 5, 7, 211. Prime factorization of 14770 in exponential form is:

14770 = 2¹ × 5¹ × 7¹ × 211¹

Step-3: Factors of 14751

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

1, 3, 9, 11, 33, 99, 149, 447, 1341, 1639, 4917

Step-4: Factors of 14770

List of positive integer factors of 14770 that divides 14751 without a remainder.

1, 2, 5, 7, 10, 14, 35, 70, 211, 422, 1055, 1477, 2110, 2954, 7385

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14751 and 14770