What is the Greatest Common Factor of 83958 and 83964?

Greatest common factor (GCF) of 83958 and 83964 is 6.

GCF(83958,83964) = 6

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

How to find the GCF of 83958 and 83964?

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

Step-1: Prime Factorization of 83958

Prime factors of 83958 are 2, 3, 7, 1999. Prime factorization of 83958 in exponential form is:

83958 = 2¹ × 3¹ × 7¹ × 1999¹

Step-2: Prime Factorization of 83964

Prime factors of 83964 are 2, 3, 6997. Prime factorization of 83964 in exponential form is:

83964 = 2² × 3¹ × 6997¹

Step-3: Factors of 83958

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

1, 2, 3, 6, 7, 14, 21, 42, 1999, 3998, 5997, 11994, 13993, 27986, 41979

Step-4: Factors of 83964

List of positive integer factors of 83964 that divides 83958 without a remainder.

1, 2, 3, 4, 6, 12, 6997, 13994, 20991, 27988, 41982

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 83958 and 83964. The biggest common factor number is the GCF number.
So the greatest common factor 83958 and 83964 is 6.

Also check out the Least Common Multiple of 83958 and 83964