GCD of 16, 64, 45 Calculator

Given Input numbers are 16, 64, 45

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

Divisors of 16

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

1, 2, 4, 8, 16

Divisors of 64

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

1, 2, 4, 8, 16, 32, 64

Divisors of 45

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

1, 3, 5, 9, 15, 45

Greatest Common Divisior

We found the divisors of 16, 64, 45 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 16, 64, 45 is 1.

Therefore, GCD of numbers 16, 64, 45 is 1

Given Input Data is 16, 64, 45

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

Prime Factorization of 16 is 2 x 2 x 2 x 2

Prime Factorization of 64 is 2 x 2 x 2 x 2 x 2 x 2

Prime Factorization of 45 is 3 x 3 x 5

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(16, 64) = 64

GCD(16, 64) = ( 16 x 64 ) / 64

GCD(16, 64) = 1024 / 64

GCD(16, 64) = 16

Step2:

Here we consider the GCD from the above i.e. 16 as first number and the next as 45

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

LCM(16, 45) = 720

GCD(16, 45) = ( 16 x 45 ) / 720

GCD(16, 45) = 720 / 720

GCD(16, 45) = 1

GCD of 16, 64, 45 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 45, 93, 86
• GCD of 78, 88, 55
• GCD of 71, 50, 14
• GCD of 62, 42, 67
• GCD of 79, 74, 21

1. What is the GCD of 16, 64, 45?

GCD of 16, 64, 45 is 1

2. Where do I get the detailed procedure to find GCD of 16, 64, 45?

You can find a detailed procedure to find GCD of 16, 64, 45 on our page.

3. How to find GCD of 16, 64, 45 on a calculator?

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