GCD of 395, 473, 397 Calculator

Given Input numbers are 395, 473, 397

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

Divisors of 395

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

1, 5, 79, 395

Divisors of 473

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

1, 11, 43, 473

Divisors of 397

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

1, 397

Greatest Common Divisior

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

Therefore, GCD of numbers 395, 473, 397 is 1

Given Input Data is 395, 473, 397

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

Prime Factorization of 395 is 5 x 79

Prime Factorization of 473 is 11 x 43

Prime Factorization of 397 is 397

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(395, 473) = 186835

GCD(395, 473) = ( 395 x 473 ) / 186835

GCD(395, 473) = 186835 / 186835

GCD(395, 473) = 1

Step2:

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

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

LCM(1, 397) = 397

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

GCD(1, 397) = 397 / 397

GCD(1, 397) = 1

GCD of 395, 473, 397 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 265, 250, 239
• GCD of 882, 694, 424
• GCD of 463, 977, 693
• GCD of 613, 254, 234
• GCD of 980, 333, 222

1. What is the GCD of 395, 473, 397?

GCD of 395, 473, 397 is 1

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

You can find a detailed procedure to find GCD of 395, 473, 397 on our page.

3. How to find GCD of 395, 473, 397 on a calculator?

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