What is the Greatest Common Factor of 16147 and 16159?

Greatest common factor (GCF) of 16147 and 16159 is 1.

GCF(16147,16159) = 1

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

How to find the GCF of 16147 and 16159?

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

Step-1: Prime Factorization of 16147

Prime factors of 16147 are 67, 241. Prime factorization of 16147 in exponential form is:

16147 = 67¹ × 241¹

Step-2: Prime Factorization of 16159

Prime factors of 16159 are 11, 13, 113. Prime factorization of 16159 in exponential form is:

16159 = 11¹ × 13¹ × 113¹

Step-3: Factors of 16147

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

1, 67, 241

Step-4: Factors of 16159

List of positive integer factors of 16159 that divides 16147 without a remainder.

1, 11, 13, 113, 143, 1243, 1469

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16147 and 16159