GCD of 669, 399, 33 Calculator

Given Input numbers are 669, 399, 33

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 669

List of positive integer divisors of 669 that divides 669 without a remainder.

1, 3, 223, 669

Divisors of 399

List of positive integer divisors of 399 that divides 399 without a remainder.

1, 3, 7, 19, 21, 57, 133, 399

Divisors of 33

List of positive integer divisors of 33 that divides 33 without a remainder.

1, 3, 11, 33

Greatest Common Divisior

We found the divisors of 669, 399, 33 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 669, 399, 33 is 3.

Therefore, GCD of numbers 669, 399, 33 is 3

Given Input Data is 669, 399, 33

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 669 is 3 x 223

Prime Factorization of 399 is 3 x 7 x 19

Prime Factorization of 33 is 3 x 11

Highest common occurrences in the given inputs are 3¹

Multiplying them we get the GCD as 3

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(669, 399) = 88977

GCD(669, 399) = ( 669 x 399 ) / 88977

GCD(669, 399) = 266931 / 88977

GCD(669, 399) = 3

Step2:

Here we consider the GCD from the above i.e. 3 as first number and the next as 33

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(3, 33) = 33

GCD(3, 33) = ( 3 x 33 ) / 33

GCD(3, 33) = 99 / 33

GCD(3, 33) = 3

GCD of 669, 399, 33 is 3

Here are some samples of GCD of Numbers calculations.

• GCD of 995, 918, 72
• GCD of 924, 978, 52
• GCD of 520, 133, 96
• GCD of 370, 546, 19
• GCD of 487, 370, 25

1. What is the GCD of 669, 399, 33?

GCD of 669, 399, 33 is 3

2. Where do I get the detailed procedure to find GCD of 669, 399, 33?

You can find a detailed procedure to find GCD of 669, 399, 33 on our page.

3. How to find GCD of 669, 399, 33 on a calculator?

You can find the GCD of 669, 399, 33 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.