What is the Greatest Common Factor of 40039 and 40052?

Greatest common factor (GCF) of 40039 and 40052 is 1.

GCF(40039,40052) = 1

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

How to find the GCF of 40039 and 40052?

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

Step-1: Prime Factorization of 40039

Prime factors of 40039 are 40039. Prime factorization of 40039 in exponential form is:

40039 = 40039¹

Step-2: Prime Factorization of 40052

Prime factors of 40052 are 2, 17, 19, 31. Prime factorization of 40052 in exponential form is:

40052 = 2² × 17¹ × 19¹ × 31¹

Step-3: Factors of 40039

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

Step-4: Factors of 40052

List of positive integer factors of 40052 that divides 40039 without a remainder.

1, 2, 4, 17, 19, 31, 34, 38, 62, 68, 76, 124, 323, 527, 589, 646, 1054, 1178, 1292, 2108, 2356, 10013, 20026

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 40039 and 40052