What is the Greatest Common Factor of 47892 and 47906?

Greatest common factor (GCF) of 47892 and 47906 is 2.

GCF(47892,47906) = 2

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

How to find the GCF of 47892 and 47906?

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

Step-1: Prime Factorization of 47892

Prime factors of 47892 are 2, 3, 13, 307. Prime factorization of 47892 in exponential form is:

47892 = 2² × 3¹ × 13¹ × 307¹

Step-2: Prime Factorization of 47906

Prime factors of 47906 are 2, 17, 1409. Prime factorization of 47906 in exponential form is:

47906 = 2¹ × 17¹ × 1409¹

Step-3: Factors of 47892

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

1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 156, 307, 614, 921, 1228, 1842, 3684, 3991, 7982, 11973, 15964, 23946

Step-4: Factors of 47906

List of positive integer factors of 47906 that divides 47892 without a remainder.

1, 2, 17, 34, 1409, 2818, 23953

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 47892 and 47906. The biggest common factor number is the GCF number.
So the greatest common factor 47892 and 47906 is 2.

Also check out the Least Common Multiple of 47892 and 47906