GCD of 392, 361, 16 Calculator

Given Input numbers are 392, 361, 16

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

Divisors of 392

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

1, 2, 4, 7, 8, 14, 28, 49, 56, 98, 196, 392

Divisors of 361

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

1, 19, 361

Divisors of 16

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

1, 2, 4, 8, 16

Greatest Common Divisior

We found the divisors of 392, 361, 16 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 392, 361, 16 is 1.

Therefore, GCD of numbers 392, 361, 16 is 1

Given Input Data is 392, 361, 16

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

Prime Factorization of 392 is 2 x 2 x 2 x 7 x 7

Prime Factorization of 361 is 19 x 19

Prime Factorization of 16 is 2 x 2 x 2 x 2

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(392, 361) = 141512

GCD(392, 361) = ( 392 x 361 ) / 141512

GCD(392, 361) = 141512 / 141512

GCD(392, 361) = 1

Step2:

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

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

LCM(1, 16) = 16

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

GCD(1, 16) = 16 / 16

GCD(1, 16) = 1

GCD of 392, 361, 16 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 339, 652, 50
• GCD of 977, 404, 56
• GCD of 817, 660, 68
• GCD of 964, 672, 55
• GCD of 137, 317, 16

1. What is the GCD of 392, 361, 16?

GCD of 392, 361, 16 is 1

2. Where do I get the detailed procedure to find GCD of 392, 361, 16?

You can find a detailed procedure to find GCD of 392, 361, 16 on our page.

3. How to find GCD of 392, 361, 16 on a calculator?

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