What is the Greatest Common Factor of 48364 and 48371?

Greatest common factor (GCF) of 48364 and 48371 is 1.

GCF(48364,48371) = 1

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

How to find the GCF of 48364 and 48371?

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

Step-1: Prime Factorization of 48364

Prime factors of 48364 are 2, 107, 113. Prime factorization of 48364 in exponential form is:

48364 = 2² × 107¹ × 113¹

Step-2: Prime Factorization of 48371

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

48371 = 48371¹

Step-3: Factors of 48364

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

1, 2, 4, 107, 113, 214, 226, 428, 452, 12091, 24182

Step-4: Factors of 48371

List of positive integer factors of 48371 that divides 48364 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48364 and 48371