What is the Greatest Common Factor of 48502 and 48513?

Greatest common factor (GCF) of 48502 and 48513 is 1.

GCF(48502,48513) = 1

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

How to find the GCF of 48502 and 48513?

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

Step-1: Prime Factorization of 48502

Prime factors of 48502 are 2, 24251. Prime factorization of 48502 in exponential form is:

48502 = 2¹ × 24251¹

Step-2: Prime Factorization of 48513

Prime factors of 48513 are 3, 103, 157. Prime factorization of 48513 in exponential form is:

48513 = 3¹ × 103¹ × 157¹

Step-3: Factors of 48502

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

1, 2, 24251

Step-4: Factors of 48513

List of positive integer factors of 48513 that divides 48502 without a remainder.

1, 3, 103, 157, 309, 471, 16171

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48502 and 48513