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