What is the Greatest Common Factor of 48561 and 48565?

Greatest common factor (GCF) of 48561 and 48565 is 1.

GCF(48561,48565) = 1

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

How to find the GCF of 48561 and 48565?

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

Step-1: Prime Factorization of 48561

Prime factors of 48561 are 3, 16187. Prime factorization of 48561 in exponential form is:

48561 = 3¹ × 16187¹

Step-2: Prime Factorization of 48565

Prime factors of 48565 are 5, 11, 883. Prime factorization of 48565 in exponential form is:

48565 = 5¹ × 11¹ × 883¹

Step-3: Factors of 48561

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

1, 3, 16187

Step-4: Factors of 48565

List of positive integer factors of 48565 that divides 48561 without a remainder.

1, 5, 11, 55, 883, 4415, 9713

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48561 and 48565