What is the Greatest Common Factor of 11476 and 11487?

Greatest common factor (GCF) of 11476 and 11487 is 1.

GCF(11476,11487) = 1

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

How to find the GCF of 11476 and 11487?

We will first find the prime factorization of 11476 and 11487. After we will calculate the factors of 11476 and 11487 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 11487

Prime factors of 11487 are 3, 7, 547. Prime factorization of 11487 in exponential form is:

11487 = 3¹ × 7¹ × 547¹

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 11487

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

1, 3, 7, 21, 547, 1641, 3829

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11476 and 11487