What is the Greatest Common Factor of 48935 and 48947?

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

GCF(48935,48947) = 1

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

How to find the GCF of 48935 and 48947?

We will first find the prime factorization of 48935 and 48947. After we will calculate the factors of 48935 and 48947 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 48947

Prime factors of 48947 are 48947. Prime factorization of 48947 in exponential form is:

48947 = 48947¹

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 48947

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48935 and 48947