What is the Greatest Common Factor of 93948 and 93961?

Greatest common factor (GCF) of 93948 and 93961 is 1.

GCF(93948,93961) = 1

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

How to find the GCF of 93948 and 93961?

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

Step-1: Prime Factorization of 93948

Prime factors of 93948 are 2, 3, 7829. Prime factorization of 93948 in exponential form is:

93948 = 2² × 3¹ × 7829¹

Step-2: Prime Factorization of 93961

Prime factors of 93961 are 7, 31, 433. Prime factorization of 93961 in exponential form is:

93961 = 7¹ × 31¹ × 433¹

Step-3: Factors of 93948

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

1, 2, 3, 4, 6, 12, 7829, 15658, 23487, 31316, 46974

Step-4: Factors of 93961

List of positive integer factors of 93961 that divides 93948 without a remainder.

1, 7, 31, 217, 433, 3031, 13423

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 93948 and 93961