What is the Greatest Common Factor of 48309 and 48325?

Greatest common factor (GCF) of 48309 and 48325 is 1.

GCF(48309,48325) = 1

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

How to find the GCF of 48309 and 48325?

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

Prime factors of 48325 are 5, 1933. Prime factorization of 48325 in exponential form is:

48325 = 5² × 1933¹

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 48325

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

1, 5, 25, 1933, 9665

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48309 and 48325