What is the Greatest Common Factor of 85957 and 85968?

Greatest common factor (GCF) of 85957 and 85968 is 1.

GCF(85957,85968) = 1

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

How to find the GCF of 85957 and 85968?

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

Step-1: Prime Factorization of 85957

Prime factors of 85957 are 43, 1999. Prime factorization of 85957 in exponential form is:

85957 = 43¹ × 1999¹

Step-2: Prime Factorization of 85968

Prime factors of 85968 are 2, 3, 199. Prime factorization of 85968 in exponential form is:

85968 = 2⁴ × 3³ × 199¹

Step-3: Factors of 85957

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

1, 43, 1999

Step-4: Factors of 85968

List of positive integer factors of 85968 that divides 85957 without a remainder.

1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72, 108, 144, 199, 216, 398, 432, 597, 796, 1194, 1592, 1791, 2388, 3184, 3582, 4776, 5373, 7164, 9552, 10746, 14328, 21492, 28656, 42984

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 85957 and 85968