GCD of 985, 501, 361 Calculator

Given Input numbers are 985, 501, 361

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

Divisors of 985

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

1, 5, 197, 985

Divisors of 501

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

1, 3, 167, 501

Divisors of 361

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

1, 19, 361

Greatest Common Divisior

We found the divisors of 985, 501, 361 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 985, 501, 361 is 1.

Therefore, GCD of numbers 985, 501, 361 is 1

Given Input Data is 985, 501, 361

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

Prime Factorization of 985 is 5 x 197

Prime Factorization of 501 is 3 x 167

Prime Factorization of 361 is 19 x 19

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(985, 501) = 493485

GCD(985, 501) = ( 985 x 501 ) / 493485

GCD(985, 501) = 493485 / 493485

GCD(985, 501) = 1

Step2:

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

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

LCM(1, 361) = 361

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

GCD(1, 361) = 361 / 361

GCD(1, 361) = 1

GCD of 985, 501, 361 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 134, 942, 850
• GCD of 201, 575, 203
• GCD of 360, 825, 506
• GCD of 311, 628, 454
• GCD of 325, 571, 956

1. What is the GCD of 985, 501, 361?

GCD of 985, 501, 361 is 1

2. Where do I get the detailed procedure to find GCD of 985, 501, 361?

You can find a detailed procedure to find GCD of 985, 501, 361 on our page.

3. How to find GCD of 985, 501, 361 on a calculator?

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