What is the Greatest Common Factor of 39752 and 39758?

Greatest common factor (GCF) of 39752 and 39758 is 2.

GCF(39752,39758) = 2

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

How to find the GCF of 39752 and 39758?

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

Step-1: Prime Factorization of 39752

Prime factors of 39752 are 2, 4969. Prime factorization of 39752 in exponential form is:

39752 = 2³ × 4969¹

Step-2: Prime Factorization of 39758

Prime factors of 39758 are 2, 103, 193. Prime factorization of 39758 in exponential form is:

39758 = 2¹ × 103¹ × 193¹

Step-3: Factors of 39752

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

1, 2, 4, 8, 4969, 9938, 19876

Step-4: Factors of 39758

List of positive integer factors of 39758 that divides 39752 without a remainder.

1, 2, 103, 193, 206, 386, 19879

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 39752 and 39758