What is the Greatest Common Factor of 15752 and 15765?

Greatest common factor (GCF) of 15752 and 15765 is 1.

GCF(15752,15765) = 1

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

How to find the GCF of 15752 and 15765?

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

Step-1: Prime Factorization of 15752

Prime factors of 15752 are 2, 11, 179. Prime factorization of 15752 in exponential form is:

15752 = 2³ × 11¹ × 179¹

Step-2: Prime Factorization of 15765

Prime factors of 15765 are 3, 5, 1051. Prime factorization of 15765 in exponential form is:

15765 = 3¹ × 5¹ × 1051¹

Step-3: Factors of 15752

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

1, 2, 4, 8, 11, 22, 44, 88, 179, 358, 716, 1432, 1969, 3938, 7876

Step-4: Factors of 15765

List of positive integer factors of 15765 that divides 15752 without a remainder.

1, 3, 5, 15, 1051, 3153, 5255

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15752 and 15765