What is the Greatest Common Factor of 1339 and 1358?

Greatest common factor (GCF) of 1339 and 1358 is 1.

GCF(1339,1358) = 1

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

How to find the GCF of 1339 and 1358?

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

Step-1: Prime Factorization of 1339

Prime factors of 1339 are 13, 103. Prime factorization of 1339 in exponential form is:

1339 = 13¹ × 103¹

Step-2: Prime Factorization of 1358

Prime factors of 1358 are 2, 7, 97. Prime factorization of 1358 in exponential form is:

1358 = 2¹ × 7¹ × 97¹

Step-3: Factors of 1339

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

1, 13, 103

Step-4: Factors of 1358

List of positive integer factors of 1358 that divides 1339 without a remainder.

1, 2, 7, 14, 97, 194, 679

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1339 and 1358