What is the Greatest Common Factor of 48335 and 48347?

Greatest common factor (GCF) of 48335 and 48347 is 1.

GCF(48335,48347) = 1

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

How to find the GCF of 48335 and 48347?

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

Step-1: Prime Factorization of 48335

Prime factors of 48335 are 5, 7, 1381. Prime factorization of 48335 in exponential form is:

48335 = 5¹ × 7¹ × 1381¹

Step-2: Prime Factorization of 48347

Prime factors of 48347 are 13, 3719. Prime factorization of 48347 in exponential form is:

48347 = 13¹ × 3719¹

Step-3: Factors of 48335

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

1, 5, 7, 35, 1381, 6905, 9667

Step-4: Factors of 48347

List of positive integer factors of 48347 that divides 48335 without a remainder.

1, 13, 3719

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48335 and 48347