What is the Greatest Common Factor of 15128 and 15146?

Greatest common factor (GCF) of 15128 and 15146 is 2.

GCF(15128,15146) = 2

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

How to find the GCF of 15128 and 15146?

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

Step-1: Prime Factorization of 15128

Prime factors of 15128 are 2, 31, 61. Prime factorization of 15128 in exponential form is:

15128 = 2³ × 31¹ × 61¹

Step-2: Prime Factorization of 15146

Prime factors of 15146 are 2, 7573. Prime factorization of 15146 in exponential form is:

15146 = 2¹ × 7573¹

Step-3: Factors of 15128

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

1, 2, 4, 8, 31, 61, 62, 122, 124, 244, 248, 488, 1891, 3782, 7564

Step-4: Factors of 15146

List of positive integer factors of 15146 that divides 15128 without a remainder.

1, 2, 7573

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 15128 and 15146. The biggest common factor number is the GCF number.
So the greatest common factor 15128 and 15146 is 2.

Also check out the Least Common Multiple of 15128 and 15146