What is the Greatest Common Factor of 94845 and 94852?

Greatest common factor (GCF) of 94845 and 94852 is 1.

GCF(94845,94852) = 1

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

How to find the GCF of 94845 and 94852?

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

Step-1: Prime Factorization of 94845

Prime factors of 94845 are 3, 5, 6323. Prime factorization of 94845 in exponential form is:

94845 = 3¹ × 5¹ × 6323¹

Step-2: Prime Factorization of 94852

Prime factors of 94852 are 2, 23, 1031. Prime factorization of 94852 in exponential form is:

94852 = 2² × 23¹ × 1031¹

Step-3: Factors of 94845

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

1, 3, 5, 15, 6323, 18969, 31615

Step-4: Factors of 94852

List of positive integer factors of 94852 that divides 94845 without a remainder.

1, 2, 4, 23, 46, 92, 1031, 2062, 4124, 23713, 47426

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 94845 and 94852