What is the Greatest Common Factor of 11490 and 11506?

Greatest common factor (GCF) of 11490 and 11506 is 2.

GCF(11490,11506) = 2

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

How to find the GCF of 11490 and 11506?

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

Step-1: Prime Factorization of 11490

Prime factors of 11490 are 2, 3, 5, 383. Prime factorization of 11490 in exponential form is:

11490 = 2¹ × 3¹ × 5¹ × 383¹

Step-2: Prime Factorization of 11506

Prime factors of 11506 are 2, 11, 523. Prime factorization of 11506 in exponential form is:

11506 = 2¹ × 11¹ × 523¹

Step-3: Factors of 11490

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

1, 2, 3, 5, 6, 10, 15, 30, 383, 766, 1149, 1915, 2298, 3830, 5745

Step-4: Factors of 11506

List of positive integer factors of 11506 that divides 11490 without a remainder.

1, 2, 11, 22, 523, 1046, 5753

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 11490 and 11506. The biggest common factor number is the GCF number.
So the greatest common factor 11490 and 11506 is 2.

Also check out the Least Common Multiple of 11490 and 11506