GCD of 345, 397, 622 Calculator

Given Input numbers are 345, 397, 622

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 345

List of positive integer divisors of 345 that divides 345 without a remainder.

1, 3, 5, 15, 23, 69, 115, 345

Divisors of 397

List of positive integer divisors of 397 that divides 397 without a remainder.

1, 397

Divisors of 622

List of positive integer divisors of 622 that divides 622 without a remainder.

1, 2, 311, 622

Greatest Common Divisior

We found the divisors of 345, 397, 622 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 345, 397, 622 is 1.

Therefore, GCD of numbers 345, 397, 622 is 1

Given Input Data is 345, 397, 622

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 345 is 3 x 5 x 23

Prime Factorization of 397 is 397

Prime Factorization of 622 is 2 x 311

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

Step1:

Let's calculate the GCD of first two numbers

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

LCM(345, 397) = 136965

GCD(345, 397) = ( 345 x 397 ) / 136965

GCD(345, 397) = 136965 / 136965

GCD(345, 397) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 622

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

LCM(1, 622) = 622

GCD(1, 622) = ( 1 x 622 ) / 622

GCD(1, 622) = 622 / 622

GCD(1, 622) = 1

GCD of 345, 397, 622 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 861, 344, 196
• GCD of 425, 295, 219
• GCD of 531, 293, 480
• GCD of 266, 462, 119
• GCD of 744, 917, 496

1. What is the GCD of 345, 397, 622?

GCD of 345, 397, 622 is 1

2. Where do I get the detailed procedure to find GCD of 345, 397, 622?

You can find a detailed procedure to find GCD of 345, 397, 622 on our page.

3. How to find GCD of 345, 397, 622 on a calculator?

You can find the GCD of 345, 397, 622 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.