What is the Greatest Common Factor of 80947 and 80958?

Greatest common factor (GCF) of 80947 and 80958 is 1.

GCF(80947,80958) = 1

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

How to find the GCF of 80947 and 80958?

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

Step-1: Prime Factorization of 80947

Prime factors of 80947 are 61, 1327. Prime factorization of 80947 in exponential form is:

80947 = 61¹ × 1327¹

Step-2: Prime Factorization of 80958

Prime factors of 80958 are 2, 3, 103, 131. Prime factorization of 80958 in exponential form is:

80958 = 2¹ × 3¹ × 103¹ × 131¹

Step-3: Factors of 80947

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

1, 61, 1327

Step-4: Factors of 80958

List of positive integer factors of 80958 that divides 80947 without a remainder.

1, 2, 3, 6, 103, 131, 206, 262, 309, 393, 618, 786, 13493, 26986, 40479

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80947 and 80958