What is the Greatest Common Factor of 13761 and 13765?

Greatest common factor (GCF) of 13761 and 13765 is 1.

GCF(13761,13765) = 1

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

How to find the GCF of 13761 and 13765?

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

Step-1: Prime Factorization of 13761

Prime factors of 13761 are 3, 11, 139. Prime factorization of 13761 in exponential form is:

13761 = 3² × 11¹ × 139¹

Step-2: Prime Factorization of 13765

Prime factors of 13765 are 5, 2753. Prime factorization of 13765 in exponential form is:

13765 = 5¹ × 2753¹

Step-3: Factors of 13761

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

1, 3, 9, 11, 33, 99, 139, 417, 1251, 1529, 4587

Step-4: Factors of 13765

List of positive integer factors of 13765 that divides 13761 without a remainder.

1, 5, 2753

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13761 and 13765