Online GCD Calculator is useful to find the GCD of 393, 213, 338 quickly. Get the easiest ways to solve the greatest common divisor of 393, 213, 338 i.e 1 in different methods as follows.
Given Input numbers are 393, 213, 338
In the factoring method, we have to find the divisors of all numbers
Divisors of 393 :
The positive integer divisors of 393 that completely divides 393 are.
1, 3, 131, 393
Divisors of 213 :
The positive integer divisors of 213 that completely divides 213 are.
1, 3, 71, 213
Divisors of 338 :
The positive integer divisors of 338 that completely divides 338 are.
1, 2, 13, 26, 169, 338
GCD of numbers is the greatest common divisor
So, the GCD (393, 213, 338) = 1.
Given numbers are 393, 213, 338
The list of prime factors of all numbers are
Prime factors of 393 are 3 x 131
Prime factors of 213 are 3 x 71
Prime factors of 338 are 2 x 13 x 13
The above numbers do not have any common prime factor. So GCD is 1
Given numbers are 393, 213, 338
GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)
Apply this formula for all numbers.
Step1:
LCM(393, 213) = 27903
GCD(393, 213) = ( 393 x 213 ) / 27903
= 393 / 213
= 393
Step2:
LCM(3, 338) = 1014
GCD(3, 338) = ( 3 x 338 ) / 1014
= 3 / 338
= 3
So, Greatest Common Divisor of 393, 213, 338 is 1
Here are some samples of GCD of Numbers calculations.
Given numbers are 393, 213, 338
The greatest common divisor of numbers 393, 213, 338 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 393, 213, 338 is 1.
1. What is the GCD of 393, 213, 338?
GCD of given numbers 393, 213, 338 is 1
2. How to calculate the greatest common divisor of 393, 213, 338?
We can find the highest common divisor of 393, 213, 338 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 393, 213, 338 i.e 1.
3. How can I use the GCD of 393, 213, 338Calculator?
Out the numbers 393, 213, 338 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.