GCD of 218, 398, 533 Calculator

Given Input numbers are 218, 398, 533

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

Divisors of 218

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

1, 2, 109, 218

Divisors of 398

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

1, 2, 199, 398

Divisors of 533

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

1, 13, 41, 533

Greatest Common Divisior

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

Therefore, GCD of numbers 218, 398, 533 is 1

Given Input Data is 218, 398, 533

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

Prime Factorization of 218 is 2 x 109

Prime Factorization of 398 is 2 x 199

Prime Factorization of 533 is 13 x 41

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(218, 398) = 43382

GCD(218, 398) = ( 218 x 398 ) / 43382

GCD(218, 398) = 86764 / 43382

GCD(218, 398) = 2

Step2:

Here we consider the GCD from the above i.e. 2 as first number and the next as 533

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

LCM(2, 533) = 1066

GCD(2, 533) = ( 2 x 533 ) / 1066

GCD(2, 533) = 1066 / 1066

GCD(2, 533) = 1

GCD of 218, 398, 533 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 602, 506, 307
• GCD of 400, 471, 212
• GCD of 619, 210, 196
• GCD of 667, 435, 749
• GCD of 682, 217, 508

1. What is the GCD of 218, 398, 533?

GCD of 218, 398, 533 is 1

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

You can find a detailed procedure to find GCD of 218, 398, 533 on our page.

3. How to find GCD of 218, 398, 533 on a calculator?

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