What is the Greatest Common Factor of 48352 and 48362?

Greatest common factor (GCF) of 48352 and 48362 is 2.

GCF(48352,48362) = 2

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

How to find the GCF of 48352 and 48362?

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

Step-1: Prime Factorization of 48352

Prime factors of 48352 are 2, 1511. Prime factorization of 48352 in exponential form is:

48352 = 2⁵ × 1511¹

Step-2: Prime Factorization of 48362

Prime factors of 48362 are 2, 24181. Prime factorization of 48362 in exponential form is:

48362 = 2¹ × 24181¹

Step-3: Factors of 48352

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

1, 2, 4, 8, 16, 32, 1511, 3022, 6044, 12088, 24176

Step-4: Factors of 48362

List of positive integer factors of 48362 that divides 48352 without a remainder.

1, 2, 24181

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48352 and 48362