What is the Greatest Common Factor of 48376 and 48390?

Greatest common factor (GCF) of 48376 and 48390 is 2.

GCF(48376,48390) = 2

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

How to find the GCF of 48376 and 48390?

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

Step-1: Prime Factorization of 48376

Prime factors of 48376 are 2, 6047. Prime factorization of 48376 in exponential form is:

48376 = 2³ × 6047¹

Step-2: Prime Factorization of 48390

Prime factors of 48390 are 2, 3, 5, 1613. Prime factorization of 48390 in exponential form is:

48390 = 2¹ × 3¹ × 5¹ × 1613¹

Step-3: Factors of 48376

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

1, 2, 4, 8, 6047, 12094, 24188

Step-4: Factors of 48390

List of positive integer factors of 48390 that divides 48376 without a remainder.

1, 2, 3, 5, 6, 10, 15, 30, 1613, 3226, 4839, 8065, 9678, 16130, 24195

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 48376 and 48390. The biggest common factor number is the GCF number.
So the greatest common factor 48376 and 48390 is 2.

Also check out the Least Common Multiple of 48376 and 48390