What is the Greatest Common Factor of 80938 and 80951?

Greatest common factor (GCF) of 80938 and 80951 is 13.

GCF(80938,80951) = 13

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

How to find the GCF of 80938 and 80951?

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

Step-1: Prime Factorization of 80938

Prime factors of 80938 are 2, 11, 13, 283. Prime factorization of 80938 in exponential form is:

80938 = 2¹ × 11¹ × 13¹ × 283¹

Step-2: Prime Factorization of 80951

Prime factors of 80951 are 13, 479. Prime factorization of 80951 in exponential form is:

80951 = 13² × 479¹

Step-3: Factors of 80938

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

1, 2, 11, 13, 22, 26, 143, 283, 286, 566, 3113, 3679, 6226, 7358, 40469

Step-4: Factors of 80951

List of positive integer factors of 80951 that divides 80938 without a remainder.

1, 13, 169, 479, 6227

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 80938 and 80951. The biggest common factor number is the GCF number.
So the greatest common factor 80938 and 80951 is 13.

Also check out the Least Common Multiple of 80938 and 80951