What is the Greatest Common Factor of 48364 and 48378?

Greatest common factor (GCF) of 48364 and 48378 is 2.

GCF(48364,48378) = 2

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

How to find the GCF of 48364 and 48378?

We will first find the prime factorization of 48364 and 48378. After we will calculate the factors of 48364 and 48378 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 48378

Prime factors of 48378 are 2, 3, 11, 733. Prime factorization of 48378 in exponential form is:

48378 = 2¹ × 3¹ × 11¹ × 733¹

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 48378

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

1, 2, 3, 6, 11, 22, 33, 66, 733, 1466, 2199, 4398, 8063, 16126, 24189

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48364 and 48378