What is the Greatest Common Factor of 48309 and 48315?

Greatest common factor (GCF) of 48309 and 48315 is 3.

GCF(48309,48315) = 3

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

How to find the GCF of 48309 and 48315?

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

Step-1: Prime Factorization of 48309

Prime factors of 48309 are 3, 16103. Prime factorization of 48309 in exponential form is:

48309 = 3¹ × 16103¹

Step-2: Prime Factorization of 48315

Prime factors of 48315 are 3, 5, 3221. Prime factorization of 48315 in exponential form is:

48315 = 3¹ × 5¹ × 3221¹

Step-3: Factors of 48309

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

1, 3, 16103

Step-4: Factors of 48315

List of positive integer factors of 48315 that divides 48309 without a remainder.

1, 3, 5, 15, 3221, 9663, 16105

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 48309 and 48315. The biggest common factor number is the GCF number.
So the greatest common factor 48309 and 48315 is 3.

Also check out the Least Common Multiple of 48309 and 48315