GCD of 395, 371, 887 Calculator

Given Input numbers are 395, 371, 887

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 371

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

1, 7, 53, 371

Divisors of 887

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

1, 887

Greatest Common Divisior

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

Therefore, GCD of numbers 395, 371, 887 is 1

Given Input Data is 395, 371, 887

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

Prime Factorization of 395 is 5 x 79

Prime Factorization of 371 is 7 x 53

Prime Factorization of 887 is 887

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, 371) = 146545

GCD(395, 371) = ( 395 x 371 ) / 146545

GCD(395, 371) = 146545 / 146545

GCD(395, 371) = 1

Step2:

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

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

LCM(1, 887) = 887

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

GCD(1, 887) = 887 / 887

GCD(1, 887) = 1

GCD of 395, 371, 887 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 309, 887, 545
• GCD of 713, 542, 954
• GCD of 745, 147, 664
• GCD of 591, 511, 300
• GCD of 860, 394, 472

1. What is the GCD of 395, 371, 887?

GCD of 395, 371, 887 is 1

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

You can find a detailed procedure to find GCD of 395, 371, 887 on our page.

3. How to find GCD of 395, 371, 887 on a calculator?

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