GCD of 359, 695, 218 Calculator

Given Input numbers are 359, 695, 218

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

Divisors of 359

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

1, 359

Divisors of 695

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

1, 5, 139, 695

Divisors of 218

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

1, 2, 109, 218

Greatest Common Divisior

We found the divisors of 359, 695, 218 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 359, 695, 218 is 1.

Therefore, GCD of numbers 359, 695, 218 is 1

Given Input Data is 359, 695, 218

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

Prime Factorization of 359 is 359

Prime Factorization of 695 is 5 x 139

Prime Factorization of 218 is 2 x 109

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(359, 695) = 249505

GCD(359, 695) = ( 359 x 695 ) / 249505

GCD(359, 695) = 249505 / 249505

GCD(359, 695) = 1

Step2:

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

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

LCM(1, 218) = 218

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

GCD(1, 218) = 218 / 218

GCD(1, 218) = 1

GCD of 359, 695, 218 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 225, 493, 190
• GCD of 247, 498, 492
• GCD of 123, 461, 793
• GCD of 243, 383, 454
• GCD of 491, 350, 747

1. What is the GCD of 359, 695, 218?

GCD of 359, 695, 218 is 1

2. Where do I get the detailed procedure to find GCD of 359, 695, 218?

You can find a detailed procedure to find GCD of 359, 695, 218 on our page.

3. How to find GCD of 359, 695, 218 on a calculator?

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