What is the Greatest Common Factor of 68902 and 68915?

Greatest common factor (GCF) of 68902 and 68915 is 1.

GCF(68902,68915) = 1

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

How to find the GCF of 68902 and 68915?

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

Step-1: Prime Factorization of 68902

Prime factors of 68902 are 2, 47, 733. Prime factorization of 68902 in exponential form is:

68902 = 2¹ × 47¹ × 733¹

Step-2: Prime Factorization of 68915

Prime factors of 68915 are 5, 7, 11, 179. Prime factorization of 68915 in exponential form is:

68915 = 5¹ × 7¹ × 11¹ × 179¹

Step-3: Factors of 68902

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

1, 2, 47, 94, 733, 1466, 34451

Step-4: Factors of 68915

List of positive integer factors of 68915 that divides 68902 without a remainder.

1, 5, 7, 11, 35, 55, 77, 179, 385, 895, 1253, 1969, 6265, 9845, 13783

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 68902 and 68915