What is the Greatest Common Factor of 48565 and 48580?

Greatest common factor (GCF) of 48565 and 48580 is 5.

GCF(48565,48580) = 5

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

How to find the GCF of 48565 and 48580?

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

Step-1: 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-2: Prime Factorization of 48580

Prime factors of 48580 are 2, 5, 7, 347. Prime factorization of 48580 in exponential form is:

48580 = 2² × 5¹ × 7¹ × 347¹

Step-3: Factors of 48565

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

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

Step-4: Factors of 48580

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

1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140, 347, 694, 1388, 1735, 2429, 3470, 4858, 6940, 9716, 12145, 24290

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48565 and 48580