GCD of 361, 264, 23 Calculator

Given Input numbers are 361, 264, 23

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 264

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

1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 44, 66, 88, 132, 264

Divisors of 23

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

1, 23

Greatest Common Divisior

We found the divisors of 361, 264, 23 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 361, 264, 23 is 1.

Therefore, GCD of numbers 361, 264, 23 is 1

Given Input Data is 361, 264, 23

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

Prime Factorization of 361 is 19 x 19

Prime Factorization of 264 is 2 x 2 x 2 x 3 x 11

Prime Factorization of 23 is 23

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, 264) = 95304

GCD(361, 264) = ( 361 x 264 ) / 95304

GCD(361, 264) = 95304 / 95304

GCD(361, 264) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 23

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

LCM(1, 23) = 23

GCD(1, 23) = ( 1 x 23 ) / 23

GCD(1, 23) = 23 / 23

GCD(1, 23) = 1

GCD of 361, 264, 23 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 425, 718, 26
• GCD of 347, 987, 60
• GCD of 352, 612, 58
• GCD of 443, 630, 13
• GCD of 642, 564, 23

1. What is the GCD of 361, 264, 23?

GCD of 361, 264, 23 is 1

2. Where do I get the detailed procedure to find GCD of 361, 264, 23?

You can find a detailed procedure to find GCD of 361, 264, 23 on our page.

3. How to find GCD of 361, 264, 23 on a calculator?

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