What is the Greatest Common Factor of 19655 and 19670?

Greatest common factor (GCF) of 19655 and 19670 is 5.

GCF(19655,19670) = 5

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

How to find the GCF of 19655 and 19670?

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

Step-1: Prime Factorization of 19655

Prime factors of 19655 are 5, 3931. Prime factorization of 19655 in exponential form is:

19655 = 5¹ × 3931¹

Step-2: Prime Factorization of 19670

Prime factors of 19670 are 2, 5, 7, 281. Prime factorization of 19670 in exponential form is:

19670 = 2¹ × 5¹ × 7¹ × 281¹

Step-3: Factors of 19655

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

1, 5, 3931

Step-4: Factors of 19670

List of positive integer factors of 19670 that divides 19655 without a remainder.

1, 2, 5, 7, 10, 14, 35, 70, 281, 562, 1405, 1967, 2810, 3934, 9835

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 19655 and 19670. The biggest common factor number is the GCF number.
So the greatest common factor 19655 and 19670 is 5.

Also check out the Least Common Multiple of 19655 and 19670