What is the Greatest Common Factor of 85939 and 85952?

Greatest common factor (GCF) of 85939 and 85952 is 1.

GCF(85939,85952) = 1

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

How to find the GCF of 85939 and 85952?

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

Step-1: Prime Factorization of 85939

Prime factors of 85939 are 7, 12277. Prime factorization of 85939 in exponential form is:

85939 = 7¹ × 12277¹

Step-2: Prime Factorization of 85952

Prime factors of 85952 are 2, 17, 79. Prime factorization of 85952 in exponential form is:

85952 = 2⁶ × 17¹ × 79¹

Step-3: Factors of 85939

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

1, 7, 12277

Step-4: Factors of 85952

List of positive integer factors of 85952 that divides 85939 without a remainder.

1, 2, 4, 8, 16, 17, 32, 34, 64, 68, 79, 136, 158, 272, 316, 544, 632, 1088, 1264, 1343, 2528, 2686, 5056, 5372, 10744, 21488, 42976

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 85939 and 85952