What is the Greatest Common Factor of 91509 and 91513?

Greatest common factor (GCF) of 91509 and 91513 is 1.

GCF(91509,91513) = 1

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

How to find the GCF of 91509 and 91513?

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

Step-1: Prime Factorization of 91509

Prime factors of 91509 are 3, 11, 47, 59. Prime factorization of 91509 in exponential form is:

91509 = 3¹ × 11¹ × 47¹ × 59¹

Step-2: Prime Factorization of 91513

Prime factors of 91513 are 91513. Prime factorization of 91513 in exponential form is:

91513 = 91513¹

Step-3: Factors of 91509

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

1, 3, 11, 33, 47, 59, 141, 177, 517, 649, 1551, 1947, 2773, 8319, 30503

Step-4: Factors of 91513

List of positive integer factors of 91513 that divides 91509 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 91509 and 91513