What is the Greatest Common Factor of 11561 and 11580?

Greatest common factor (GCF) of 11561 and 11580 is 1.

GCF(11561,11580) = 1

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

How to find the GCF of 11561 and 11580?

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

Step-1: Prime Factorization of 11561

Prime factors of 11561 are 11, 1051. Prime factorization of 11561 in exponential form is:

11561 = 11¹ × 1051¹

Step-2: Prime Factorization of 11580

Prime factors of 11580 are 2, 3, 5, 193. Prime factorization of 11580 in exponential form is:

11580 = 2² × 3¹ × 5¹ × 193¹

Step-3: Factors of 11561

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

1, 11, 1051

Step-4: Factors of 11580

List of positive integer factors of 11580 that divides 11561 without a remainder.

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 193, 386, 579, 772, 965, 1158, 1930, 2316, 2895, 3860, 5790

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11561 and 11580