What is the Greatest Common Factor of 94937 and 94952?

Greatest common factor (GCF) of 94937 and 94952 is 1.

GCF(94937,94952) = 1

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

How to find the GCF of 94937 and 94952?

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

Step-1: Prime Factorization of 94937

Prime factors of 94937 are 139, 683. Prime factorization of 94937 in exponential form is:

94937 = 139¹ × 683¹

Step-2: Prime Factorization of 94952

Prime factors of 94952 are 2, 11, 13, 83. Prime factorization of 94952 in exponential form is:

94952 = 2³ × 11¹ × 13¹ × 83¹

Step-3: Factors of 94937

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

1, 139, 683

Step-4: Factors of 94952

List of positive integer factors of 94952 that divides 94937 without a remainder.

1, 2, 4, 8, 11, 13, 22, 26, 44, 52, 83, 88, 104, 143, 166, 286, 332, 572, 664, 913, 1079, 1144, 1826, 2158, 3652, 4316, 7304, 8632, 11869, 23738, 47476

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 94937 and 94952