What is the Greatest Common Factor of 80948 and 80953?

Greatest common factor (GCF) of 80948 and 80953 is 1.

GCF(80948,80953) = 1

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

How to find the GCF of 80948 and 80953?

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

Step-1: Prime Factorization of 80948

Prime factors of 80948 are 2, 7, 59. Prime factorization of 80948 in exponential form is:

80948 = 2² × 7³ × 59¹

Step-2: Prime Factorization of 80953

Prime factors of 80953 are 80953. Prime factorization of 80953 in exponential form is:

80953 = 80953¹

Step-3: Factors of 80948

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

1, 2, 4, 7, 14, 28, 49, 59, 98, 118, 196, 236, 343, 413, 686, 826, 1372, 1652, 2891, 5782, 11564, 20237, 40474

Step-4: Factors of 80953

List of positive integer factors of 80953 that divides 80948 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80948 and 80953