What is the Greatest Common Factor of 83964 and 83971?

Greatest common factor (GCF) of 83964 and 83971 is 1.

GCF(83964,83971) = 1

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

How to find the GCF of 83964 and 83971?

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

Step-1: 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-2: Prime Factorization of 83971

Prime factors of 83971 are 131, 641. Prime factorization of 83971 in exponential form is:

83971 = 131¹ × 641¹

Step-3: Factors of 83964

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

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

Step-4: Factors of 83971

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

1, 131, 641

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 83964 and 83971