GCD of 368, 283, 18 Calculator

Given Input numbers are 368, 283, 18

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

Divisors of 368

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

1, 2, 4, 8, 16, 23, 46, 92, 184, 368

Divisors of 283

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

1, 283

Divisors of 18

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

1, 2, 3, 6, 9, 18

Greatest Common Divisior

We found the divisors of 368, 283, 18 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 368, 283, 18 is 1.

Therefore, GCD of numbers 368, 283, 18 is 1

Given Input Data is 368, 283, 18

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

Prime Factorization of 368 is 2 x 2 x 2 x 2 x 23

Prime Factorization of 283 is 283

Prime Factorization of 18 is 2 x 3 x 3

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(368, 283) = 104144

GCD(368, 283) = ( 368 x 283 ) / 104144

GCD(368, 283) = 104144 / 104144

GCD(368, 283) = 1

Step2:

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

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

LCM(1, 18) = 18

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

GCD(1, 18) = 18 / 18

GCD(1, 18) = 1

GCD of 368, 283, 18 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 209, 276, 39
• GCD of 597, 690, 34
• GCD of 176, 305, 80
• GCD of 508, 645, 99
• GCD of 380, 699, 72

1. What is the GCD of 368, 283, 18?

GCD of 368, 283, 18 is 1

2. Where do I get the detailed procedure to find GCD of 368, 283, 18?

You can find a detailed procedure to find GCD of 368, 283, 18 on our page.

3. How to find GCD of 368, 283, 18 on a calculator?

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