GCD of 936, 273, 153, 361 Calculator

Given Input numbers are 936, 273, 153, 361

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

Divisors of 936 :

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

1, 2, 3, 4, 6, 8, 9, 12, 13, 18, 24, 26, 36, 39, 52, 72, 78, 104, 117, 156, 234, 312, 468, 936

Divisors of 273 :

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

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

Divisors of 153 :

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

1, 3, 9, 17, 51, 153

Divisors of 361 :

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

1, 19, 361

GCD of numbers is the greatest common divisor

So, the GCD (936, 273, 153, 361) = 1.

Given numbers are 936, 273, 153, 361

The list of prime factors of all numbers are

Prime factors of 936 are 2 x 2 x 2 x 3 x 3 x 13

Prime factors of 273 are 3 x 7 x 13

Prime factors of 153 are 3 x 3 x 17

Prime factors of 361 are 19 x 19

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

Given numbers are 936, 273, 153, 361

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

Apply this formula for all numbers.

Step1:

LCM(936, 273) = 6552

GCD(936, 273) = ( 936 x 273 ) / 6552

= 936 / 273

= 936

Step2:

LCM(39, 153) = 1989

GCD(39, 153) = ( 39 x 153 ) / 1989

= 39 / 153

= 39

Step3:

LCM(3, 361) = 1083

GCD(3, 361) = ( 3 x 361 ) / 1083

= 3 / 361

= 3

So, Greatest Common Divisor of 936, 273, 153, 361 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 662, 357, 514, 973
• GCD of 770, 705, 122, 409
• GCD of 786, 827, 726, 691
• GCD of 474, 917, 873, 610
• GCD of 367, 807, 235, 389

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

1. What is the GCD of 936, 273, 153, 361?

GCD of given numbers 936, 273, 153, 361 is 1

2. How to calculate the greatest common divisor of 936, 273, 153, 361?

We can find the highest common divisor of 936, 273, 153, 361 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 936, 273, 153, 361 i.e 1.

3. How can I use the GCD of 936, 273, 153, 361Calculator?

Out the numbers 936, 273, 153, 361 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.