What is the Greatest Common Factor of 65148 and 65167?

Greatest common factor (GCF) of 65148 and 65167 is 1.

GCF(65148,65167) = 1

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

How to find the GCF of 65148 and 65167?

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

Step-1: Prime Factorization of 65148

Prime factors of 65148 are 2, 3, 61, 89. Prime factorization of 65148 in exponential form is:

65148 = 2² × 3¹ × 61¹ × 89¹

Step-2: Prime Factorization of 65167

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

65167 = 65167¹

Step-3: Factors of 65148

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

1, 2, 3, 4, 6, 12, 61, 89, 122, 178, 183, 244, 267, 356, 366, 534, 732, 1068, 5429, 10858, 16287, 21716, 32574

Step-4: Factors of 65167

List of positive integer factors of 65167 that divides 65148 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65148 and 65167