What is the Greatest Common Factor of 68939 and 68946?

Greatest common factor (GCF) of 68939 and 68946 is 1.

GCF(68939,68946) = 1

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

How to find the GCF of 68939 and 68946?

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

Step-1: Prime Factorization of 68939

Prime factors of 68939 are 13, 5303. Prime factorization of 68939 in exponential form is:

68939 = 13¹ × 5303¹

Step-2: Prime Factorization of 68946

Prime factors of 68946 are 2, 3, 11491. Prime factorization of 68946 in exponential form is:

68946 = 2¹ × 3¹ × 11491¹

Step-3: Factors of 68939

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

1, 13, 5303

Step-4: Factors of 68946

List of positive integer factors of 68946 that divides 68939 without a remainder.

1, 2, 3, 6, 11491, 22982, 34473

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 68939 and 68946