What is the Greatest Common Factor of 48346 and 48366?

Greatest common factor (GCF) of 48346 and 48366 is 2.

GCF(48346,48366) = 2

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

How to find the GCF of 48346 and 48366?

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

Step-1: Prime Factorization of 48346

Prime factors of 48346 are 2, 23, 1051. Prime factorization of 48346 in exponential form is:

48346 = 2¹ × 23¹ × 1051¹

Step-2: Prime Factorization of 48366

Prime factors of 48366 are 2, 3, 2687. Prime factorization of 48366 in exponential form is:

48366 = 2¹ × 3² × 2687¹

Step-3: Factors of 48346

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

1, 2, 23, 46, 1051, 2102, 24173

Step-4: Factors of 48366

List of positive integer factors of 48366 that divides 48346 without a remainder.

1, 2, 3, 6, 9, 18, 2687, 5374, 8061, 16122, 24183

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48346 and 48366