GCD of 331, 893, 489 Calculator

Given Input numbers are 331, 893, 489

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

Divisors of 331

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

1, 331

Divisors of 893

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

1, 19, 47, 893

Divisors of 489

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

1, 3, 163, 489

Greatest Common Divisior

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

Therefore, GCD of numbers 331, 893, 489 is 1

Given Input Data is 331, 893, 489

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

Prime Factorization of 331 is 331

Prime Factorization of 893 is 19 x 47

Prime Factorization of 489 is 3 x 163

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(331, 893) = 295583

GCD(331, 893) = ( 331 x 893 ) / 295583

GCD(331, 893) = 295583 / 295583

GCD(331, 893) = 1

Step2:

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

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

LCM(1, 489) = 489

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

GCD(1, 489) = 489 / 489

GCD(1, 489) = 1

GCD of 331, 893, 489 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 415, 341, 230
• GCD of 350, 384, 189
• GCD of 377, 696, 433
• GCD of 236, 780, 212
• GCD of 675, 567, 149

1. What is the GCD of 331, 893, 489?

GCD of 331, 893, 489 is 1

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

You can find a detailed procedure to find GCD of 331, 893, 489 on our page.

3. How to find GCD of 331, 893, 489 on a calculator?

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