What is the Greatest Common Factor of 85940 and 85953?

Greatest common factor (GCF) of 85940 and 85953 is 1.

GCF(85940,85953) = 1

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

How to find the GCF of 85940 and 85953?

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

Step-1: Prime Factorization of 85940

Prime factors of 85940 are 2, 5, 4297. Prime factorization of 85940 in exponential form is:

85940 = 2² × 5¹ × 4297¹

Step-2: Prime Factorization of 85953

Prime factors of 85953 are 3, 7, 4093. Prime factorization of 85953 in exponential form is:

85953 = 3¹ × 7¹ × 4093¹

Step-3: Factors of 85940

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

1, 2, 4, 5, 10, 20, 4297, 8594, 17188, 21485, 42970

Step-4: Factors of 85953

List of positive integer factors of 85953 that divides 85940 without a remainder.

1, 3, 7, 21, 4093, 12279, 28651

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 85940 and 85953