What is the Greatest Common Factor of 64752 and 64765?

Greatest common factor (GCF) of 64752 and 64765 is 1.

GCF(64752,64765) = 1

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

How to find the GCF of 64752 and 64765?

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

Step-1: Prime Factorization of 64752

Prime factors of 64752 are 2, 3, 19, 71. Prime factorization of 64752 in exponential form is:

64752 = 2⁴ × 3¹ × 19¹ × 71¹

Step-2: Prime Factorization of 64765

Prime factors of 64765 are 5, 12953. Prime factorization of 64765 in exponential form is:

64765 = 5¹ × 12953¹

Step-3: Factors of 64752

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

1, 2, 3, 4, 6, 8, 12, 16, 19, 24, 38, 48, 57, 71, 76, 114, 142, 152, 213, 228, 284, 304, 426, 456, 568, 852, 912, 1136, 1349, 1704, 2698, 3408, 4047, 5396, 8094, 10792, 16188, 21584, 32376

Step-4: Factors of 64765

List of positive integer factors of 64765 that divides 64752 without a remainder.

1, 5, 12953

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64752 and 64765