What is the Greatest Common Factor of 65130 and 65147?

Greatest common factor (GCF) of 65130 and 65147 is 1.

GCF(65130,65147) = 1

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

How to find the GCF of 65130 and 65147?

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

Step-1: Prime Factorization of 65130

Prime factors of 65130 are 2, 3, 5, 13, 167. Prime factorization of 65130 in exponential form is:

65130 = 2¹ × 3¹ × 5¹ × 13¹ × 167¹

Step-2: Prime Factorization of 65147

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

65147 = 65147¹

Step-3: Factors of 65130

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

1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 130, 167, 195, 334, 390, 501, 835, 1002, 1670, 2171, 2505, 4342, 5010, 6513, 10855, 13026, 21710, 32565

Step-4: Factors of 65147

List of positive integer factors of 65147 that divides 65130 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65130 and 65147