What is the Greatest Common Factor of 47565 and 47584?

Greatest common factor (GCF) of 47565 and 47584 is 1.

GCF(47565,47584) = 1

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

How to find the GCF of 47565 and 47584?

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

Step-1: Prime Factorization of 47565

Prime factors of 47565 are 3, 5, 7, 151. Prime factorization of 47565 in exponential form is:

47565 = 3² × 5¹ × 7¹ × 151¹

Step-2: Prime Factorization of 47584

Prime factors of 47584 are 2, 1487. Prime factorization of 47584 in exponential form is:

47584 = 2⁵ × 1487¹

Step-3: Factors of 47565

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

1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 151, 315, 453, 755, 1057, 1359, 2265, 3171, 5285, 6795, 9513, 15855

Step-4: Factors of 47584

List of positive integer factors of 47584 that divides 47565 without a remainder.

1, 2, 4, 8, 16, 32, 1487, 2974, 5948, 11896, 23792

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47565 and 47584