GCD of 692, 865, 145 Calculator

Given Input numbers are 692, 865, 145

In the factoring method, we have to find the divisors of all numbers

Divisors of 692 :

The positive integer divisors of 692 that completely divides 692 are.

1, 2, 4, 173, 346, 692

Divisors of 865 :

The positive integer divisors of 865 that completely divides 865 are.

1, 5, 173, 865

Divisors of 145 :

The positive integer divisors of 145 that completely divides 145 are.

1, 5, 29, 145

GCD of numbers is the greatest common divisor

So, the GCD (692, 865, 145) = 1.

Given numbers are 692, 865, 145

The list of prime factors of all numbers are

Prime factors of 692 are 2 x 2 x 173

Prime factors of 865 are 5 x 173

Prime factors of 145 are 5 x 29

The above numbers do not have any common prime factor. So GCD is 1

Given numbers are 692, 865, 145

GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)

Apply this formula for all numbers.

Step1:

LCM(692, 865) = 3460

GCD(692, 865) = ( 692 x 865 ) / 3460

= 692 / 865

= 692

Step2:

LCM(173, 145) = 25085

GCD(173, 145) = ( 173 x 145 ) / 25085

= 173 / 145

= 173

So, Greatest Common Divisor of 692, 865, 145 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 852, 366, 112
• GCD of 479, 852, 349
• GCD of 869, 147, 466
• GCD of 137, 395, 619
• GCD of 899, 805, 340

Given numbers are 692, 865, 145
The greatest common divisor of numbers 692, 865, 145 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 692, 865, 145 is 1.

1. What is the GCD of 692, 865, 145?

GCD of given numbers 692, 865, 145 is 1

2. How to calculate the greatest common divisor of 692, 865, 145?

We can find the highest common divisor of 692, 865, 145 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 692, 865, 145 i.e 1.

3. How can I use the GCD of 692, 865, 145Calculator?

Out the numbers 692, 865, 145 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.