What is the Greatest Common Factor of 47833 and 47852?

Greatest common factor (GCF) of 47833 and 47852 is 1.

GCF(47833,47852) = 1

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

How to find the GCF of 47833 and 47852?

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

Step-1: Prime Factorization of 47833

Prime factors of 47833 are 31, 1543. Prime factorization of 47833 in exponential form is:

47833 = 31¹ × 1543¹

Step-2: Prime Factorization of 47852

Prime factors of 47852 are 2, 7, 1709. Prime factorization of 47852 in exponential form is:

47852 = 2² × 7¹ × 1709¹

Step-3: Factors of 47833

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

1, 31, 1543

Step-4: Factors of 47852

List of positive integer factors of 47852 that divides 47833 without a remainder.

1, 2, 4, 7, 14, 28, 1709, 3418, 6836, 11963, 23926

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47833 and 47852