What is the Greatest Common Factor of 74840 and 74851?

Greatest common factor (GCF) of 74840 and 74851 is 1.

GCF(74840,74851) = 1

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

How to find the GCF of 74840 and 74851?

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

Step-1: Prime Factorization of 74840

Prime factors of 74840 are 2, 5, 1871. Prime factorization of 74840 in exponential form is:

74840 = 2³ × 5¹ × 1871¹

Step-2: Prime Factorization of 74851

Prime factors of 74851 are 7, 17, 37. Prime factorization of 74851 in exponential form is:

74851 = 7¹ × 17² × 37¹

Step-3: Factors of 74840

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

1, 2, 4, 5, 8, 10, 20, 40, 1871, 3742, 7484, 9355, 14968, 18710, 37420

Step-4: Factors of 74851

List of positive integer factors of 74851 that divides 74840 without a remainder.

1, 7, 17, 37, 119, 259, 289, 629, 2023, 4403, 10693

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 74840 and 74851