What is the Greatest Common Factor of 74839 and 74852?

Greatest common factor (GCF) of 74839 and 74852 is 1.

GCF(74839,74852) = 1

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

How to find the GCF of 74839 and 74852?

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

Step-1: Prime Factorization of 74839

Prime factors of 74839 are 67, 1117. Prime factorization of 74839 in exponential form is:

74839 = 67¹ × 1117¹

Step-2: Prime Factorization of 74852

Prime factors of 74852 are 2, 18713. Prime factorization of 74852 in exponential form is:

74852 = 2² × 18713¹

Step-3: Factors of 74839

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

1, 67, 1117

Step-4: Factors of 74852

List of positive integer factors of 74852 that divides 74839 without a remainder.

1, 2, 4, 18713, 37426

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 74839 and 74852