GCD of 861, 483, 897, 273 Calculator

Given Input numbers are 861, 483, 897, 273

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

Divisors of 861 :

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

1, 3, 7, 21, 41, 123, 287, 861

Divisors of 483 :

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

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

Divisors of 897 :

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

1, 3, 13, 23, 39, 69, 299, 897

Divisors of 273 :

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

1, 3, 7, 13, 21, 39, 91, 273

GCD of numbers is the greatest common divisor

So, the GCD (861, 483, 897, 273) = 3.

Given numbers are 861, 483, 897, 273

The list of prime factors of all numbers are

Prime factors of 861 are 3 x 7 x 41

Prime factors of 483 are 3 x 7 x 23

Prime factors of 897 are 3 x 13 x 23

Prime factors of 273 are 3 x 7 x 13

The highest common occurrence is 3¹

Therefore, GCD of 861, 483, 897, 273 is 3.

Given numbers are 861, 483, 897, 273

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

Apply this formula for all numbers.

Step1:

LCM(861, 483) = 19803

GCD(861, 483) = ( 861 x 483 ) / 19803

= 861 / 483

= 861

Step2:

LCM(21, 897) = 6279

GCD(21, 897) = ( 21 x 897 ) / 6279

= 21 / 897

= 21

Step3:

LCM(3, 273) = 273

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

= 3 / 273

= 3

So, Greatest Common Divisor of 861, 483, 897, 273 is 3

Here are some samples of GCD of Numbers calculations.

• GCD of 992, 687, 508, 141
• GCD of 687, 585, 741, 487
• GCD of 289, 328, 274, 935
• GCD of 663, 144, 595, 836
• GCD of 114, 325, 428, 130

Given numbers are 861, 483, 897, 273
The greatest common divisor of numbers 861, 483, 897, 273 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 861, 483, 897, 273 is 3.

1. What is the GCD of 861, 483, 897, 273?

GCD of given numbers 861, 483, 897, 273 is 3

2. How to calculate the greatest common divisor of 861, 483, 897, 273?

We can find the highest common divisor of 861, 483, 897, 273 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 861, 483, 897, 273 i.e 3.

3. How can I use the GCD of 861, 483, 897, 273Calculator?

Out the numbers 861, 483, 897, 273 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.