What is the Greatest Common Factor of 48295 and 48308?

Greatest common factor (GCF) of 48295 and 48308 is 13.

GCF(48295,48308) = 13

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

How to find the GCF of 48295 and 48308?

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

Step-1: Prime Factorization of 48295

Prime factors of 48295 are 5, 13, 743. Prime factorization of 48295 in exponential form is:

48295 = 5¹ × 13¹ × 743¹

Step-2: Prime Factorization of 48308

Prime factors of 48308 are 2, 13, 929. Prime factorization of 48308 in exponential form is:

48308 = 2² × 13¹ × 929¹

Step-3: Factors of 48295

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

1, 5, 13, 65, 743, 3715, 9659

Step-4: Factors of 48308

List of positive integer factors of 48308 that divides 48295 without a remainder.

1, 2, 4, 13, 26, 52, 929, 1858, 3716, 12077, 24154

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 48295 and 48308. The biggest common factor number is the GCF number.
So the greatest common factor 48295 and 48308 is 13.

Also check out the Least Common Multiple of 48295 and 48308