GCD of 801, 393, 482 Calculator

Given Input numbers are 801, 393, 482

In the factoring method, we have to find the divisors of all numbers

Divisors of 801 :

The positive integer divisors of 801 that completely divides 801 are.

1, 3, 9, 89, 267, 801

Divisors of 393 :

The positive integer divisors of 393 that completely divides 393 are.

1, 3, 131, 393

Divisors of 482 :

The positive integer divisors of 482 that completely divides 482 are.

1, 2, 241, 482

GCD of numbers is the greatest common divisor

So, the GCD (801, 393, 482) = 1.

Given numbers are 801, 393, 482

The list of prime factors of all numbers are

Prime factors of 801 are 3 x 3 x 89

Prime factors of 393 are 3 x 131

Prime factors of 482 are 2 x 241

The above numbers do not have any common prime factor. So GCD is 1

Given numbers are 801, 393, 482

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

Apply this formula for all numbers.

Step1:

LCM(801, 393) = 104931

GCD(801, 393) = ( 801 x 393 ) / 104931

= 801 / 393

= 801

Step2:

LCM(3, 482) = 1446

GCD(3, 482) = ( 3 x 482 ) / 1446

= 3 / 482

= 3

So, Greatest Common Divisor of 801, 393, 482 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 405, 935, 734
• GCD of 823, 153, 910
• GCD of 929, 960, 522
• GCD of 126, 966, 723
• GCD of 722, 200, 512

Given numbers are 801, 393, 482
The greatest common divisor of numbers 801, 393, 482 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 801, 393, 482 is 1.

1. What is the GCD of 801, 393, 482?

GCD of given numbers 801, 393, 482 is 1

2. How to calculate the greatest common divisor of 801, 393, 482?

We can find the highest common divisor of 801, 393, 482 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 801, 393, 482 i.e 1.

3. How can I use the GCD of 801, 393, 482Calculator?

Out the numbers 801, 393, 482 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.