What is the Greatest Common Factor of 65398 and 65405?

Greatest common factor (GCF) of 65398 and 65405 is 1.

GCF(65398,65405) = 1

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

How to find the GCF of 65398 and 65405?

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

Step-1: Prime Factorization of 65398

Prime factors of 65398 are 2, 19, 1721. Prime factorization of 65398 in exponential form is:

65398 = 2¹ × 19¹ × 1721¹

Step-2: Prime Factorization of 65405

Prime factors of 65405 are 5, 103, 127. Prime factorization of 65405 in exponential form is:

65405 = 5¹ × 103¹ × 127¹

Step-3: Factors of 65398

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

1, 2, 19, 38, 1721, 3442, 32699

Step-4: Factors of 65405

List of positive integer factors of 65405 that divides 65398 without a remainder.

1, 5, 103, 127, 515, 635, 13081

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65398 and 65405