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 361, 985, 60, 713 i.e. 1 largest integer that divides all the numbers equally.
GCD of 361, 985, 60, 713 is 1
GCD(361, 985, 60, 713) = 1
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
GCD of numbers 361, 985, 60, 713 is 1
GCD(361, 985, 60, 713) = 1
Given Input numbers are 361, 985, 60, 713
To find the GCD of numbers using factoring list out all the divisors of each number
Divisors of 361
List of positive integer divisors of 361 that divides 361 without a remainder.
1, 19, 361
Divisors of 985
List of positive integer divisors of 985 that divides 985 without a remainder.
1, 5, 197, 985
Divisors of 60
List of positive integer divisors of 60 that divides 60 without a remainder.
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
Divisors of 713
List of positive integer divisors of 713 that divides 713 without a remainder.
1, 23, 31, 713
Greatest Common Divisior
We found the divisors of 361, 985, 60, 713 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 361, 985, 60, 713 is 1.
Therefore, GCD of numbers 361, 985, 60, 713 is 1
Given Input Data is 361, 985, 60, 713
Make a list of Prime Factors of all the given numbers initially
Prime Factorization of 361 is 19 x 19
Prime Factorization of 985 is 5 x 197
Prime Factorization of 60 is 2 x 2 x 3 x 5
Prime Factorization of 713 is 23 x 31
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(361, 985) = 355585
GCD(361, 985) = ( 361 x 985 ) / 355585
GCD(361, 985) = 355585 / 355585
GCD(361, 985) = 1
Step2:
Here we consider the GCD from the above i.e. 1 as first number and the next as 60
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(1, 60) = 60
GCD(1, 60) = ( 1 x 60 ) / 60
GCD(1, 60) = 60 / 60
GCD(1, 60) = 1
Step3:
Here we consider the GCD from the above i.e. 1 as first number and the next as 713
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(1, 713) = 713
GCD(1, 713) = ( 1 x 713 ) / 713
GCD(1, 713) = 713 / 713
GCD(1, 713) = 1
GCD of 361, 985, 60, 713 is 1
Here are some samples of GCD of Numbers calculations.
1. What is the GCD of 361, 985, 60, 713?
GCD of 361, 985, 60, 713 is 1
2. Where do I get the detailed procedure to find GCD of 361, 985, 60, 713?
You can find a detailed procedure to find GCD of 361, 985, 60, 713 on our page.
3. How to find GCD of 361, 985, 60, 713 on a calculator?
You can find the GCD of 361, 985, 60, 713 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.