What is the Greatest Common Factor of 11481 and 11492?

Greatest common factor (GCF) of 11481 and 11492 is 1.

GCF(11481,11492) = 1

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

How to find the GCF of 11481 and 11492?

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

Step-1: Prime Factorization of 11481

Prime factors of 11481 are 3, 43, 89. Prime factorization of 11481 in exponential form is:

11481 = 3¹ × 43¹ × 89¹

Step-2: Prime Factorization of 11492

Prime factors of 11492 are 2, 13, 17. Prime factorization of 11492 in exponential form is:

11492 = 2² × 13² × 17¹

Step-3: Factors of 11481

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

1, 3, 43, 89, 129, 267, 3827

Step-4: Factors of 11492

List of positive integer factors of 11492 that divides 11481 without a remainder.

1, 2, 4, 13, 17, 26, 34, 52, 68, 169, 221, 338, 442, 676, 884, 2873, 5746

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11481 and 11492