What is the Greatest Common Factor of 48505 and 48511?

Greatest common factor (GCF) of 48505 and 48511 is 1.

GCF(48505,48511) = 1

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

How to find the GCF of 48505 and 48511?

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

Step-1: Prime Factorization of 48505

Prime factors of 48505 are 5, 89, 109. Prime factorization of 48505 in exponential form is:

48505 = 5¹ × 89¹ × 109¹

Step-2: Prime Factorization of 48511

Prime factors of 48511 are 139, 349. Prime factorization of 48511 in exponential form is:

48511 = 139¹ × 349¹

Step-3: Factors of 48505

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

1, 5, 89, 109, 445, 545, 9701

Step-4: Factors of 48511

List of positive integer factors of 48511 that divides 48505 without a remainder.

1, 139, 349

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48505 and 48511