GCD of 239, 146, 48 Calculator

Given Input numbers are 239, 146, 48

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

Divisors of 239

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

1, 239

Divisors of 146

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

1, 2, 73, 146

Divisors of 48

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

1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Greatest Common Divisior

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

Therefore, GCD of numbers 239, 146, 48 is 1

Given Input Data is 239, 146, 48

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

Prime Factorization of 239 is 239

Prime Factorization of 146 is 2 x 73

Prime Factorization of 48 is 2 x 2 x 2 x 2 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(239, 146) = 34894

GCD(239, 146) = ( 239 x 146 ) / 34894

GCD(239, 146) = 34894 / 34894

GCD(239, 146) = 1

Step2:

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

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

LCM(1, 48) = 48

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

GCD(1, 48) = 48 / 48

GCD(1, 48) = 1

GCD of 239, 146, 48 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 413, 440, 93
• GCD of 792, 319, 96
• GCD of 334, 129, 88
• GCD of 556, 536, 37
• GCD of 576, 220, 89

1. What is the GCD of 239, 146, 48?

GCD of 239, 146, 48 is 1

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

You can find a detailed procedure to find GCD of 239, 146, 48 on our page.

3. How to find GCD of 239, 146, 48 on a calculator?

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