GCD of 959, 489, 173 Calculator

Given Input numbers are 959, 489, 173

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

Divisors of 959

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

1, 7, 137, 959

Divisors of 489

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

1, 3, 163, 489

Divisors of 173

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

1, 173

Greatest Common Divisior

We found the divisors of 959, 489, 173 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 959, 489, 173 is 1.

Therefore, GCD of numbers 959, 489, 173 is 1

Given Input Data is 959, 489, 173

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

Prime Factorization of 959 is 7 x 137

Prime Factorization of 489 is 3 x 163

Prime Factorization of 173 is 173

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(959, 489) = 468951

GCD(959, 489) = ( 959 x 489 ) / 468951

GCD(959, 489) = 468951 / 468951

GCD(959, 489) = 1

Step2:

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

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

LCM(1, 173) = 173

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

GCD(1, 173) = 173 / 173

GCD(1, 173) = 1

GCD of 959, 489, 173 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 217, 787, 777
• GCD of 419, 862, 890
• GCD of 126, 325, 615
• GCD of 460, 715, 549
• GCD of 671, 777, 903

1. What is the GCD of 959, 489, 173?

GCD of 959, 489, 173 is 1

2. Where do I get the detailed procedure to find GCD of 959, 489, 173?

You can find a detailed procedure to find GCD of 959, 489, 173 on our page.

3. How to find GCD of 959, 489, 173 on a calculator?

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