GCD of 229, 398, 393 Calculator

Given Input numbers are 229, 398, 393

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

Divisors of 229

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

1, 229

Divisors of 398

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

1, 2, 199, 398

Divisors of 393

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

1, 3, 131, 393

Greatest Common Divisior

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

Therefore, GCD of numbers 229, 398, 393 is 1

Given Input Data is 229, 398, 393

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

Prime Factorization of 229 is 229

Prime Factorization of 398 is 2 x 199

Prime Factorization of 393 is 3 x 131

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(229, 398) = 91142

GCD(229, 398) = ( 229 x 398 ) / 91142

GCD(229, 398) = 91142 / 91142

GCD(229, 398) = 1

Step2:

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

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

LCM(1, 393) = 393

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

GCD(1, 393) = 393 / 393

GCD(1, 393) = 1

GCD of 229, 398, 393 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 174, 377, 457
• GCD of 436, 947, 351
• GCD of 998, 300, 242
• GCD of 946, 690, 622
• GCD of 324, 796, 583

1. What is the GCD of 229, 398, 393?

GCD of 229, 398, 393 is 1

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

You can find a detailed procedure to find GCD of 229, 398, 393 on our page.

3. How to find GCD of 229, 398, 393 on a calculator?

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