GCD of 552, 146, 330 Calculator
Reviewed By : Phani Ponnapalli
Last Updated at : Mar 29,2023
Online GCD Calculator is useful to find the GCD of 552, 146, 330 quickly. Get the easiest ways to solve the greatest common divisor of 552, 146, 330 i.e 2 in different methods as follows.
Given Input numbers are 552, 146, 330
In the factoring method, we have to find the divisors of all numbers
Divisors of 552 :
The positive integer divisors of 552 that completely divides 552 are.
1, 2, 3, 4, 6, 8, 12, 23, 24, 46, 69, 92, 138, 184, 276, 552
Divisors of 146 :
The positive integer divisors of 146 that completely divides 146 are.
1, 2, 73, 146
Divisors of 330 :
The positive integer divisors of 330 that completely divides 330 are.
1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 66, 110, 165, 330
GCD of numbers is the greatest common divisor
So, the GCD (552, 146, 330) = 2.
Given numbers are 552, 146, 330
The list of prime factors of all numbers are
Prime factors of 552 are 2 x 2 x 2 x 3 x 23
Prime factors of 146 are 2 x 73
Prime factors of 330 are 2 x 3 x 5 x 11
The highest common occurrence is 21
Therefore, GCD of 552, 146, 330 is 2.
Steps to Calculate GCD of 552, 146, 330 using LCM Formula
Given numbers are 552, 146, 330
GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)
Apply this formula for all numbers.
Step1:
LCM(552, 146) = 40296
GCD(552, 146) = ( 552 x 146 ) / 40296
= 552 / 146
= 552
Step2:
LCM(2, 330) = 330
GCD(2, 330) = ( 2 x 330 ) / 330
= 2 / 330
= 2
So, Greatest Common Divisor of 552, 146, 330 is 2
GCD of Numbers Calculation Examples
Here are some samples of GCD of Numbers calculations.
Greatest Common Divisor of 552, 146, 330
Given numbers are 552, 146, 330
The greatest common divisor of numbers 552, 146, 330 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 552, 146, 330 is 2.
FAQs on GCD of 552, 146, 330 Calculator
1. What is the GCD of 552, 146, 330?
GCD of given numbers 552, 146, 330 is 2
2. How to calculate the greatest common divisor of 552, 146, 330?
We can find the highest common divisor of 552, 146, 330 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 552, 146, 330 i.e 2.
3. How can I use the GCD of 552, 146, 330Calculator?
Out the numbers 552, 146, 330 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.