Created By : Jatin Gogia
Reviewed By : Rajasekhar Valipishetty
Last Updated : Apr 06, 2023
Make use of GCD Calculator to determine the Greatest Common Divisor of 489, 991, 30, 293 i.e. 1 largest integer that divides all the numbers equally.
GCD of 489, 991, 30, 293 is 1
GCD(489, 991, 30, 293) = 1
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
GCD of numbers 489, 991, 30, 293 is 1
GCD(489, 991, 30, 293) = 1
Given Input numbers are 489, 991, 30, 293
To find the GCD of numbers using factoring list out all the divisors of each number
Divisors of 489
List of positive integer divisors of 489 that divides 489 without a remainder.
1, 3, 163, 489
Divisors of 991
List of positive integer divisors of 991 that divides 991 without a remainder.
1, 991
Divisors of 30
List of positive integer divisors of 30 that divides 30 without a remainder.
1, 2, 3, 5, 6, 10, 15, 30
Divisors of 293
List of positive integer divisors of 293 that divides 293 without a remainder.
1, 293
Greatest Common Divisior
We found the divisors of 489, 991, 30, 293 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 489, 991, 30, 293 is 1.
Therefore, GCD of numbers 489, 991, 30, 293 is 1
Given Input Data is 489, 991, 30, 293
Make a list of Prime Factors of all the given numbers initially
Prime Factorization of 489 is 3 x 163
Prime Factorization of 991 is 991
Prime Factorization of 30 is 2 x 3 x 5
Prime Factorization of 293 is 293
The above numbers do not have any common prime factor. So GCD is 1
Step1:
Let's calculate the GCD of first two numbers
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(489, 991) = 484599
GCD(489, 991) = ( 489 x 991 ) / 484599
GCD(489, 991) = 484599 / 484599
GCD(489, 991) = 1
Step2:
Here we consider the GCD from the above i.e. 1 as first number and the next as 30
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(1, 30) = 30
GCD(1, 30) = ( 1 x 30 ) / 30
GCD(1, 30) = 30 / 30
GCD(1, 30) = 1
Step3:
Here we consider the GCD from the above i.e. 1 as first number and the next as 293
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(1, 293) = 293
GCD(1, 293) = ( 1 x 293 ) / 293
GCD(1, 293) = 293 / 293
GCD(1, 293) = 1
GCD of 489, 991, 30, 293 is 1
Here are some samples of GCD of Numbers calculations.
1. What is the GCD of 489, 991, 30, 293?
GCD of 489, 991, 30, 293 is 1
2. Where do I get the detailed procedure to find GCD of 489, 991, 30, 293?
You can find a detailed procedure to find GCD of 489, 991, 30, 293 on our page.
3. How to find GCD of 489, 991, 30, 293 on a calculator?
You can find the GCD of 489, 991, 30, 293 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.