GCD of 138, 361, 290 Calculator

Given Input numbers are 138, 361, 290

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

Divisors of 138 :

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

1, 2, 3, 6, 23, 46, 69, 138

Divisors of 361 :

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

1, 19, 361

Divisors of 290 :

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

1, 2, 5, 10, 29, 58, 145, 290

GCD of numbers is the greatest common divisor

So, the GCD (138, 361, 290) = 1.

Given numbers are 138, 361, 290

The list of prime factors of all numbers are

Prime factors of 138 are 2 x 3 x 23

Prime factors of 361 are 19 x 19

Prime factors of 290 are 2 x 5 x 29

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

Given numbers are 138, 361, 290

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

Apply this formula for all numbers.

Step1:

LCM(138, 361) = 49818

GCD(138, 361) = ( 138 x 361 ) / 49818

= 138 / 361

= 138

Step2:

LCM(1, 290) = 290

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

= 1 / 290

= 1

So, Greatest Common Divisor of 138, 361, 290 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 416, 171, 964
• GCD of 933, 283, 563
• GCD of 110, 106, 314
• GCD of 346, 383, 250
• GCD of 375, 544, 538

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

1. What is the GCD of 138, 361, 290?

GCD of given numbers 138, 361, 290 is 1

2. How to calculate the greatest common divisor of 138, 361, 290?

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

3. How can I use the GCD of 138, 361, 290Calculator?

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