What is the Greatest Common Factor of 9752 and 9765?

Greatest common factor (GCF) of 9752 and 9765 is 1.

GCF(9752,9765) = 1

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

How to find the GCF of 9752 and 9765?

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

Step-1: Prime Factorization of 9752

Prime factors of 9752 are 2, 23, 53. Prime factorization of 9752 in exponential form is:

9752 = 2³ × 23¹ × 53¹

Step-2: Prime Factorization of 9765

Prime factors of 9765 are 3, 5, 7, 31. Prime factorization of 9765 in exponential form is:

9765 = 3² × 5¹ × 7¹ × 31¹

Step-3: Factors of 9752

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

1, 2, 4, 8, 23, 46, 53, 92, 106, 184, 212, 424, 1219, 2438, 4876

Step-4: Factors of 9765

List of positive integer factors of 9765 that divides 9752 without a remainder.

1, 3, 5, 7, 9, 15, 21, 31, 35, 45, 63, 93, 105, 155, 217, 279, 315, 465, 651, 1085, 1395, 1953, 3255

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 9752 and 9765