What is the Greatest Common Factor of 11352 and 11369?

Greatest common factor (GCF) of 11352 and 11369 is 1.

GCF(11352,11369) = 1

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

How to find the GCF of 11352 and 11369?

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

Step-1: Prime Factorization of 11352

Prime factors of 11352 are 2, 3, 11, 43. Prime factorization of 11352 in exponential form is:

11352 = 2³ × 3¹ × 11¹ × 43¹

Step-2: Prime Factorization of 11369

Prime factors of 11369 are 11369. Prime factorization of 11369 in exponential form is:

11369 = 11369¹

Step-3: Factors of 11352

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

1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 43, 44, 66, 86, 88, 129, 132, 172, 258, 264, 344, 473, 516, 946, 1032, 1419, 1892, 2838, 3784, 5676

Step-4: Factors of 11369

List of positive integer factors of 11369 that divides 11352 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11352 and 11369