What is the Greatest Common Factor of 47902 and 47913?

Greatest common factor (GCF) of 47902 and 47913 is 1.

GCF(47902,47913) = 1

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

How to find the GCF of 47902 and 47913?

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

Step-1: Prime Factorization of 47902

Prime factors of 47902 are 2, 43, 557. Prime factorization of 47902 in exponential form is:

47902 = 2¹ × 43¹ × 557¹

Step-2: Prime Factorization of 47913

Prime factors of 47913 are 3, 15971. Prime factorization of 47913 in exponential form is:

47913 = 3¹ × 15971¹

Step-3: Factors of 47902

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

1, 2, 43, 86, 557, 1114, 23951

Step-4: Factors of 47913

List of positive integer factors of 47913 that divides 47902 without a remainder.

1, 3, 15971

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47902 and 47913