What is the Greatest Common Factor of 68485 and 68502?

Greatest common factor (GCF) of 68485 and 68502 is 1.

GCF(68485,68502) = 1

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

How to find the GCF of 68485 and 68502?

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

Step-1: Prime Factorization of 68485

Prime factors of 68485 are 5, 13697. Prime factorization of 68485 in exponential form is:

68485 = 5¹ × 13697¹

Step-2: Prime Factorization of 68502

Prime factors of 68502 are 2, 3, 7, 233. Prime factorization of 68502 in exponential form is:

68502 = 2¹ × 3¹ × 7² × 233¹

Step-3: Factors of 68485

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

1, 5, 13697

Step-4: Factors of 68502

List of positive integer factors of 68502 that divides 68485 without a remainder.

1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 233, 294, 466, 699, 1398, 1631, 3262, 4893, 9786, 11417, 22834, 34251

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 68485 and 68502