What is the Greatest Common Factor of 47947 and 47958?

Greatest common factor (GCF) of 47947 and 47958 is 1.

GCF(47947,47958) = 1

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

How to find the GCF of 47947 and 47958?

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

Step-1: Prime Factorization of 47947

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

47947 = 47947¹

Step-2: Prime Factorization of 47958

Prime factors of 47958 are 2, 3, 7993. Prime factorization of 47958 in exponential form is:

47958 = 2¹ × 3¹ × 7993¹

Step-3: Factors of 47947

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

Step-4: Factors of 47958

List of positive integer factors of 47958 that divides 47947 without a remainder.

1, 2, 3, 6, 7993, 15986, 23979

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47947 and 47958