What is the Greatest Common Factor of 64465 and 64476?

Greatest common factor (GCF) of 64465 and 64476 is 1.

GCF(64465,64476) = 1

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

How to find the GCF of 64465 and 64476?

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

Step-1: Prime Factorization of 64465

Prime factors of 64465 are 5, 12893. Prime factorization of 64465 in exponential form is:

64465 = 5¹ × 12893¹

Step-2: Prime Factorization of 64476

Prime factors of 64476 are 2, 3, 199. Prime factorization of 64476 in exponential form is:

64476 = 2² × 3⁴ × 199¹

Step-3: Factors of 64465

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

1, 5, 12893

Step-4: Factors of 64476

List of positive integer factors of 64476 that divides 64465 without a remainder.

1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 199, 324, 398, 597, 796, 1194, 1791, 2388, 3582, 5373, 7164, 10746, 16119, 21492, 32238

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64465 and 64476