What is the Greatest Common Factor of 93671 and 93680?

Greatest common factor (GCF) of 93671 and 93680 is 1.

GCF(93671,93680) = 1

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

How to find the GCF of 93671 and 93680?

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

Step-1: Prime Factorization of 93671

Prime factors of 93671 are 47, 1993. Prime factorization of 93671 in exponential form is:

93671 = 47¹ × 1993¹

Step-2: Prime Factorization of 93680

Prime factors of 93680 are 2, 5, 1171. Prime factorization of 93680 in exponential form is:

93680 = 2⁴ × 5¹ × 1171¹

Step-3: Factors of 93671

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

1, 47, 1993

Step-4: Factors of 93680

List of positive integer factors of 93680 that divides 93671 without a remainder.

1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 1171, 2342, 4684, 5855, 9368, 11710, 18736, 23420, 46840

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 93671 and 93680