GCD of 488, 163, 381 Calculator

Given Input numbers are 488, 163, 381

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

Divisors of 488

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

1, 2, 4, 8, 61, 122, 244, 488

Divisors of 163

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

1, 163

Divisors of 381

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

1, 3, 127, 381

Greatest Common Divisior

We found the divisors of 488, 163, 381 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 488, 163, 381 is 1.

Therefore, GCD of numbers 488, 163, 381 is 1

Given Input Data is 488, 163, 381

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

Prime Factorization of 488 is 2 x 2 x 2 x 61

Prime Factorization of 163 is 163

Prime Factorization of 381 is 3 x 127

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(488, 163) = 79544

GCD(488, 163) = ( 488 x 163 ) / 79544

GCD(488, 163) = 79544 / 79544

GCD(488, 163) = 1

Step2:

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

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

LCM(1, 381) = 381

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

GCD(1, 381) = 381 / 381

GCD(1, 381) = 1

GCD of 488, 163, 381 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 468, 319, 698
• GCD of 330, 495, 188
• GCD of 838, 795, 461
• GCD of 118, 988, 233
• GCD of 832, 132, 776

1. What is the GCD of 488, 163, 381?

GCD of 488, 163, 381 is 1

2. Where do I get the detailed procedure to find GCD of 488, 163, 381?

You can find a detailed procedure to find GCD of 488, 163, 381 on our page.

3. How to find GCD of 488, 163, 381 on a calculator?

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