GCD of 360, 130, 688 Calculator
Reviewed By : Phani Ponnapalli
Last Updated at : Mar 29,2023
Online GCD Calculator is useful to find the GCD of 360, 130, 688 quickly. Get the easiest ways to solve the greatest common divisor of 360, 130, 688 i.e 2 in different methods as follows.
Given Input numbers are 360, 130, 688
In the factoring method, we have to find the divisors of all numbers
Divisors of 360 :
The positive integer divisors of 360 that completely divides 360 are.
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120, 180, 360
Divisors of 130 :
The positive integer divisors of 130 that completely divides 130 are.
1, 2, 5, 10, 13, 26, 65, 130
Divisors of 688 :
The positive integer divisors of 688 that completely divides 688 are.
1, 2, 4, 8, 16, 43, 86, 172, 344, 688
GCD of numbers is the greatest common divisor
So, the GCD (360, 130, 688) = 2.
Given numbers are 360, 130, 688
The list of prime factors of all numbers are
Prime factors of 360 are 2 x 2 x 2 x 3 x 3 x 5
Prime factors of 130 are 2 x 5 x 13
Prime factors of 688 are 2 x 2 x 2 x 2 x 43
The highest common occurrence is 21
Therefore, GCD of 360, 130, 688 is 2.
Steps to Calculate GCD of 360, 130, 688 using LCM Formula
Given numbers are 360, 130, 688
GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)
Apply this formula for all numbers.
Step1:
LCM(360, 130) = 4680
GCD(360, 130) = ( 360 x 130 ) / 4680
= 360 / 130
= 360
Step2:
LCM(10, 688) = 3440
GCD(10, 688) = ( 10 x 688 ) / 3440
= 10 / 688
= 10
So, Greatest Common Divisor of 360, 130, 688 is 2
GCD of Numbers Calculation Examples
Here are some samples of GCD of Numbers calculations.
Greatest Common Divisor of 360, 130, 688
Given numbers are 360, 130, 688
The greatest common divisor of numbers 360, 130, 688 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 360, 130, 688 is 2.
FAQs on GCD of 360, 130, 688 Calculator
1. What is the GCD of 360, 130, 688?
GCD of given numbers 360, 130, 688 is 2
2. How to calculate the greatest common divisor of 360, 130, 688?
We can find the highest common divisor of 360, 130, 688 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 360, 130, 688 i.e 2.
3. How can I use the GCD of 360, 130, 688Calculator?
Out the numbers 360, 130, 688 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.