GCD of 367, 865, 159 Calculator

Given Input numbers are 367, 865, 159

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

Divisors of 367

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

1, 367

Divisors of 865

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

1, 5, 173, 865

Divisors of 159

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

1, 3, 53, 159

Greatest Common Divisior

We found the divisors of 367, 865, 159 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 367, 865, 159 is 1.

Therefore, GCD of numbers 367, 865, 159 is 1

Given Input Data is 367, 865, 159

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

Prime Factorization of 367 is 367

Prime Factorization of 865 is 5 x 173

Prime Factorization of 159 is 3 x 53

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(367, 865) = 317455

GCD(367, 865) = ( 367 x 865 ) / 317455

GCD(367, 865) = 317455 / 317455

GCD(367, 865) = 1

Step2:

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

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

LCM(1, 159) = 159

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

GCD(1, 159) = 159 / 159

GCD(1, 159) = 1

GCD of 367, 865, 159 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 845, 235, 504
• GCD of 572, 712, 602
• GCD of 277, 785, 653
• GCD of 355, 589, 422
• GCD of 753, 648, 813

1. What is the GCD of 367, 865, 159?

GCD of 367, 865, 159 is 1

2. Where do I get the detailed procedure to find GCD of 367, 865, 159?

You can find a detailed procedure to find GCD of 367, 865, 159 on our page.

3. How to find GCD of 367, 865, 159 on a calculator?

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