What is the Greatest Common Factor of 11495 and 11508?

Greatest common factor (GCF) of 11495 and 11508 is 1.

GCF(11495,11508) = 1

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

How to find the GCF of 11495 and 11508?

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

Step-1: Prime Factorization of 11495

Prime factors of 11495 are 5, 11, 19. Prime factorization of 11495 in exponential form is:

11495 = 5¹ × 11² × 19¹

Step-2: Prime Factorization of 11508

Prime factors of 11508 are 2, 3, 7, 137. Prime factorization of 11508 in exponential form is:

11508 = 2² × 3¹ × 7¹ × 137¹

Step-3: Factors of 11495

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

1, 5, 11, 19, 55, 95, 121, 209, 605, 1045, 2299

Step-4: Factors of 11508

List of positive integer factors of 11508 that divides 11495 without a remainder.

1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 137, 274, 411, 548, 822, 959, 1644, 1918, 2877, 3836, 5754

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11495 and 11508