What is the Greatest Common Factor of 64476 and 64485?

Greatest common factor (GCF) of 64476 and 64485 is 9.

GCF(64476,64485) = 9

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

How to find the GCF of 64476 and 64485?

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

Step-1: 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-2: Prime Factorization of 64485

Prime factors of 64485 are 3, 5, 1433. Prime factorization of 64485 in exponential form is:

64485 = 3² × 5¹ × 1433¹

Step-3: Factors of 64476

List of positive integer factors of 64476 that divides 64476 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

Step-4: Factors of 64485

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

1, 3, 5, 9, 15, 45, 1433, 4299, 7165, 12897, 21495

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64476 and 64485