What is the Greatest Common Factor of 15765 and 15769?

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

GCF(15765,15769) = 1

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

How to find the GCF of 15765 and 15769?

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

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

Prime factors of 15769 are 13, 1213. Prime factorization of 15769 in exponential form is:

15769 = 13¹ × 1213¹

Step-3: Factors of 15765

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

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

Step-4: Factors of 15769

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

1, 13, 1213

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15765 and 15769