What is the Greatest Common Factor of 94802 and 94815?

Greatest common factor (GCF) of 94802 and 94815 is 1.

GCF(94802,94815) = 1

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

How to find the GCF of 94802 and 94815?

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

Step-1: Prime Factorization of 94802

Prime factors of 94802 are 2, 107, 443. Prime factorization of 94802 in exponential form is:

94802 = 2¹ × 107¹ × 443¹

Step-2: Prime Factorization of 94815

Prime factors of 94815 are 3, 5, 7, 43. Prime factorization of 94815 in exponential form is:

94815 = 3² × 5¹ × 7² × 43¹

Step-3: Factors of 94802

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

1, 2, 107, 214, 443, 886, 47401

Step-4: Factors of 94815

List of positive integer factors of 94815 that divides 94802 without a remainder.

1, 3, 5, 7, 9, 15, 21, 35, 43, 45, 49, 63, 105, 129, 147, 215, 245, 301, 315, 387, 441, 645, 735, 903, 1505, 1935, 2107, 2205, 2709, 4515, 6321, 10535, 13545, 18963, 31605

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 94802 and 94815