What is the Greatest Common Factor of 11487 and 11496?

Greatest common factor (GCF) of 11487 and 11496 is 3.

GCF(11487,11496) = 3

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

How to find the GCF of 11487 and 11496?

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

Step-1: 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-2: Prime Factorization of 11496

Prime factors of 11496 are 2, 3, 479. Prime factorization of 11496 in exponential form is:

11496 = 2³ × 3¹ × 479¹

Step-3: Factors of 11487

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

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

Step-4: Factors of 11496

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

1, 2, 3, 4, 6, 8, 12, 24, 479, 958, 1437, 1916, 2874, 3832, 5748

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11487 and 11496