What is the Greatest Common Factor of 11565 and 11581?

Greatest common factor (GCF) of 11565 and 11581 is 1.

GCF(11565,11581) = 1

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

How to find the GCF of 11565 and 11581?

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

Step-1: Prime Factorization of 11565

Prime factors of 11565 are 3, 5, 257. Prime factorization of 11565 in exponential form is:

11565 = 3² × 5¹ × 257¹

Step-2: Prime Factorization of 11581

Prime factors of 11581 are 37, 313. Prime factorization of 11581 in exponential form is:

11581 = 37¹ × 313¹

Step-3: Factors of 11565

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

1, 3, 5, 9, 15, 45, 257, 771, 1285, 2313, 3855

Step-4: Factors of 11581

List of positive integer factors of 11581 that divides 11565 without a remainder.

1, 37, 313

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11565 and 11581