What is the Greatest Common Factor of 83958 and 83962?

Greatest common factor (GCF) of 83958 and 83962 is 2.

GCF(83958,83962) = 2

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

How to find the GCF of 83958 and 83962?

We will first find the prime factorization of 83958 and 83962. After we will calculate the factors of 83958 and 83962 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 83962

Prime factors of 83962 are 2, 41981. Prime factorization of 83962 in exponential form is:

83962 = 2¹ × 41981¹

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 83962

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

1, 2, 41981

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 83958 and 83962