What is the Greatest Common Factor of 15141 and 15160?

Greatest common factor (GCF) of 15141 and 15160 is 1.

GCF(15141,15160) = 1

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

How to find the GCF of 15141 and 15160?

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

Step-1: Prime Factorization of 15141

Prime factors of 15141 are 3, 7, 103. Prime factorization of 15141 in exponential form is:

15141 = 3¹ × 7² × 103¹

Step-2: Prime Factorization of 15160

Prime factors of 15160 are 2, 5, 379. Prime factorization of 15160 in exponential form is:

15160 = 2³ × 5¹ × 379¹

Step-3: Factors of 15141

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

1, 3, 7, 21, 49, 103, 147, 309, 721, 2163, 5047

Step-4: Factors of 15160

List of positive integer factors of 15160 that divides 15141 without a remainder.

1, 2, 4, 5, 8, 10, 20, 40, 379, 758, 1516, 1895, 3032, 3790, 7580

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15141 and 15160