GCD of 363, 240, 503 Calculator

Given Input numbers are 363, 240, 503

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

Divisors of 363

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

1, 3, 11, 33, 121, 363

Divisors of 240

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

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48, 60, 80, 120, 240

Divisors of 503

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

1, 503

Greatest Common Divisior

We found the divisors of 363, 240, 503 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 363, 240, 503 is 1.

Therefore, GCD of numbers 363, 240, 503 is 1

Given Input Data is 363, 240, 503

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

Prime Factorization of 363 is 3 x 11 x 11

Prime Factorization of 240 is 2 x 2 x 2 x 2 x 3 x 5

Prime Factorization of 503 is 503

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(363, 240) = 29040

GCD(363, 240) = ( 363 x 240 ) / 29040

GCD(363, 240) = 87120 / 29040

GCD(363, 240) = 3

Step2:

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

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

LCM(3, 503) = 1509

GCD(3, 503) = ( 3 x 503 ) / 1509

GCD(3, 503) = 1509 / 1509

GCD(3, 503) = 1

GCD of 363, 240, 503 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 579, 355, 657
• GCD of 595, 521, 811
• GCD of 452, 530, 160
• GCD of 596, 653, 642
• GCD of 964, 318, 738

1. What is the GCD of 363, 240, 503?

GCD of 363, 240, 503 is 1

2. Where do I get the detailed procedure to find GCD of 363, 240, 503?

You can find a detailed procedure to find GCD of 363, 240, 503 on our page.

3. How to find GCD of 363, 240, 503 on a calculator?

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