GCD of 992, 146, 19 Calculator

Given Input numbers are 992, 146, 19

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

Divisors of 992

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

1, 2, 4, 8, 16, 31, 32, 62, 124, 248, 496, 992

Divisors of 146

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

1, 2, 73, 146

Divisors of 19

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

1, 19

Greatest Common Divisior

We found the divisors of 992, 146, 19 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 992, 146, 19 is 1.

Therefore, GCD of numbers 992, 146, 19 is 1

Given Input Data is 992, 146, 19

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

Prime Factorization of 992 is 2 x 2 x 2 x 2 x 2 x 31

Prime Factorization of 146 is 2 x 73

Prime Factorization of 19 is 19

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(992, 146) = 72416

GCD(992, 146) = ( 992 x 146 ) / 72416

GCD(992, 146) = 144832 / 72416

GCD(992, 146) = 2

Step2:

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

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

LCM(2, 19) = 38

GCD(2, 19) = ( 2 x 19 ) / 38

GCD(2, 19) = 38 / 38

GCD(2, 19) = 1

GCD of 992, 146, 19 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 390, 404, 63
• GCD of 466, 639, 59
• GCD of 393, 522, 21
• GCD of 585, 356, 56
• GCD of 571, 480, 79

1. What is the GCD of 992, 146, 19?

GCD of 992, 146, 19 is 1

2. Where do I get the detailed procedure to find GCD of 992, 146, 19?

You can find a detailed procedure to find GCD of 992, 146, 19 on our page.

3. How to find GCD of 992, 146, 19 on a calculator?

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