GCD of 698, 489, 389 Calculator

Given Input numbers are 698, 489, 389

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

Divisors of 698

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

1, 2, 349, 698

Divisors of 489

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

1, 3, 163, 489

Divisors of 389

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

1, 389

Greatest Common Divisior

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

Therefore, GCD of numbers 698, 489, 389 is 1

Given Input Data is 698, 489, 389

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

Prime Factorization of 698 is 2 x 349

Prime Factorization of 489 is 3 x 163

Prime Factorization of 389 is 389

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(698, 489) = 341322

GCD(698, 489) = ( 698 x 489 ) / 341322

GCD(698, 489) = 341322 / 341322

GCD(698, 489) = 1

Step2:

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

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

LCM(1, 389) = 389

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

GCD(1, 389) = 389 / 389

GCD(1, 389) = 1

GCD of 698, 489, 389 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 685, 218, 955
• GCD of 101, 250, 502
• GCD of 913, 359, 454
• GCD of 350, 755, 359
• GCD of 613, 908, 530

1. What is the GCD of 698, 489, 389?

GCD of 698, 489, 389 is 1

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

You can find a detailed procedure to find GCD of 698, 489, 389 on our page.

3. How to find GCD of 698, 489, 389 on a calculator?

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