What is the Greatest Common Factor of 65136 and 65147?

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

GCF(65136,65147) = 1

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

How to find the GCF of 65136 and 65147?

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

Step-1: Prime Factorization of 65136

Prime factors of 65136 are 2, 3, 23, 59. Prime factorization of 65136 in exponential form is:

65136 = 2⁴ × 3¹ × 23¹ × 59¹

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 65136

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

1, 2, 3, 4, 6, 8, 12, 16, 23, 24, 46, 48, 59, 69, 92, 118, 138, 177, 184, 236, 276, 354, 368, 472, 552, 708, 944, 1104, 1357, 1416, 2714, 2832, 4071, 5428, 8142, 10856, 16284, 21712, 32568

Step-4: Factors of 65147

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65136 and 65147