What is the Greatest Common Factor of 94715 and 94728?

Greatest common factor (GCF) of 94715 and 94728 is 1.

GCF(94715,94728) = 1

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

How to find the GCF of 94715 and 94728?

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

Step-1: Prime Factorization of 94715

Prime factors of 94715 are 5, 19, 997. Prime factorization of 94715 in exponential form is:

94715 = 5¹ × 19¹ × 997¹

Step-2: Prime Factorization of 94728

Prime factors of 94728 are 2, 3, 3947. Prime factorization of 94728 in exponential form is:

94728 = 2³ × 3¹ × 3947¹

Step-3: Factors of 94715

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

1, 5, 19, 95, 997, 4985, 18943

Step-4: Factors of 94728

List of positive integer factors of 94728 that divides 94715 without a remainder.

1, 2, 3, 4, 6, 8, 12, 24, 3947, 7894, 11841, 15788, 23682, 31576, 47364

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 94715 and 94728