What is the Greatest Common Factor of 6939 and 6958?

Greatest common factor (GCF) of 6939 and 6958 is 1.

GCF(6939,6958) = 1

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

How to find the GCF of 6939 and 6958?

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

Step-1: Prime Factorization of 6939

Prime factors of 6939 are 3, 257. Prime factorization of 6939 in exponential form is:

6939 = 3³ × 257¹

Step-2: Prime Factorization of 6958

Prime factors of 6958 are 2, 7, 71. Prime factorization of 6958 in exponential form is:

6958 = 2¹ × 7² × 71¹

Step-3: Factors of 6939

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

1, 3, 9, 27, 257, 771, 2313

Step-4: Factors of 6958

List of positive integer factors of 6958 that divides 6939 without a remainder.

1, 2, 7, 14, 49, 71, 98, 142, 497, 994, 3479

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 6939 and 6958