What is the Greatest Common Factor of 11496 and 11513?

Greatest common factor (GCF) of 11496 and 11513 is 1.

GCF(11496,11513) = 1

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

How to find the GCF of 11496 and 11513?

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

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

Prime factors of 11513 are 29, 397. Prime factorization of 11513 in exponential form is:

11513 = 29¹ × 397¹

Step-3: Factors of 11496

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

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

Step-4: Factors of 11513

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

1, 29, 397

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11496 and 11513