GCD of 483, 645, 390, 331 Calculator

Given Input numbers are 483, 645, 390, 331

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

Divisors of 483 :

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

1, 3, 7, 21, 23, 69, 161, 483

Divisors of 645 :

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

1, 3, 5, 15, 43, 129, 215, 645

Divisors of 390 :

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

1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 130, 195, 390

Divisors of 331 :

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

1, 331

GCD of numbers is the greatest common divisor

So, the GCD (483, 645, 390, 331) = 1.

Given numbers are 483, 645, 390, 331

The list of prime factors of all numbers are

Prime factors of 483 are 3 x 7 x 23

Prime factors of 645 are 3 x 5 x 43

Prime factors of 390 are 2 x 3 x 5 x 13

Prime factors of 331 are 331

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

Given numbers are 483, 645, 390, 331

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

Apply this formula for all numbers.

Step1:

LCM(483, 645) = 103845

GCD(483, 645) = ( 483 x 645 ) / 103845

= 483 / 645

= 483

Step2:

LCM(3, 390) = 390

GCD(3, 390) = ( 3 x 390 ) / 390

= 3 / 390

= 3

Step3:

LCM(3, 331) = 993

GCD(3, 331) = ( 3 x 331 ) / 993

= 3 / 331

= 3

So, Greatest Common Divisor of 483, 645, 390, 331 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 693, 485, 855, 533
• GCD of 871, 866, 517, 664
• GCD of 197, 291, 405, 732
• GCD of 748, 549, 742, 940
• GCD of 511, 712, 584, 577

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

1. What is the GCD of 483, 645, 390, 331?

GCD of given numbers 483, 645, 390, 331 is 1

2. How to calculate the greatest common divisor of 483, 645, 390, 331?

We can find the highest common divisor of 483, 645, 390, 331 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 483, 645, 390, 331 i.e 1.

3. How can I use the GCD of 483, 645, 390, 331Calculator?

Out the numbers 483, 645, 390, 331 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.