What is the Greatest Common Factor of 48935 and 48951?

Greatest common factor (GCF) of 48935 and 48951 is 1.

GCF(48935,48951) = 1

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

How to find the GCF of 48935 and 48951?

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

Step-1: Prime Factorization of 48935

Prime factors of 48935 are 5, 9787. Prime factorization of 48935 in exponential form is:

48935 = 5¹ × 9787¹

Step-2: Prime Factorization of 48951

Prime factors of 48951 are 3, 7, 37. Prime factorization of 48951 in exponential form is:

48951 = 3³ × 7² × 37¹

Step-3: Factors of 48935

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

1, 5, 9787

Step-4: Factors of 48951

List of positive integer factors of 48951 that divides 48935 without a remainder.

1, 3, 7, 9, 21, 27, 37, 49, 63, 111, 147, 189, 259, 333, 441, 777, 999, 1323, 1813, 2331, 5439, 6993, 16317

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48935 and 48951