What is the Greatest Common Factor of 11476 and 11480?

Greatest common factor (GCF) of 11476 and 11480 is 4.

GCF(11476,11480) = 4

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

How to find the GCF of 11476 and 11480?

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

Step-1: Prime Factorization of 11476

Prime factors of 11476 are 2, 19, 151. Prime factorization of 11476 in exponential form is:

11476 = 2² × 19¹ × 151¹

Step-2: Prime Factorization of 11480

Prime factors of 11480 are 2, 5, 7, 41. Prime factorization of 11480 in exponential form is:

11480 = 2³ × 5¹ × 7¹ × 41¹

Step-3: Factors of 11476

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

1, 2, 4, 19, 38, 76, 151, 302, 604, 2869, 5738

Step-4: Factors of 11480

List of positive integer factors of 11480 that divides 11476 without a remainder.

1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 41, 56, 70, 82, 140, 164, 205, 280, 287, 328, 410, 574, 820, 1148, 1435, 1640, 2296, 2870, 5740

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 11476 and 11480. The biggest common factor number is the GCF number.
So the greatest common factor 11476 and 11480 is 4.

Also check out the Least Common Multiple of 11476 and 11480