What the number divisible by 48 and 60?

GCF of 48 and 60 is the largest possible number that divides 48 and 60 exactly without any remainder. The factors of 48 and 60 are 1, 2, 3, 4, 6, 8, 12, 16, 24, 48 and 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60 respectively. There are 3 commonly used methods to find the GCF of 48 and 60 - Euclidean algorithm, long division, and prime factorization.

What is GCF of 48 and 60?

Answer: GCF of 48 and 60 is 12.

Explanation:

The GCF of two non-zero integers, x(48) and y(60), is the greatest positive integer m(12) that divides both x(48) and y(60) without any remainder.

Methods to Find GCF of 48 and 60

The methods to find the GCF of 48 and 60 are explained below.

• Prime Factorization Method
• Listing Common Factors
• Long Division Method

GCF of 48 and 60 by Prime Factorization

Prime factorization of 48 and 60 is (2 × 2 × 2 × 2 × 3) and (2 × 2 × 3 × 5) respectively. As visible, 48 and 60 have common prime factors. Hence, the GCF of 48 and 60 is 2 × 2 × 3 = 12.

GCF of 48 and 60 by Listing Common Factors

• Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
• Factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60

There are 6 common factors of 48 and 60, that are 1, 2, 3, 4, 6, and 12. Therefore, the greatest common factor of 48 and 60 is 12.

GCF of 48 and 60 by Long Division

GCF of 48 and 60 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.

• Step 1: Divide 60 (larger number) by 48 (smaller number).
• Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (48) by the remainder (12).
• Step 3: Repeat this process until the remainder = 0.

The corresponding divisor (12) is the GCF of 48 and 60.

☛ Also Check:

The GCF of 48 and 60 is 12. To calculate the GCF (Greatest Common Factor) of 48 and 60, we need to factor each number (factors of 48 = 1, 2, 3, 4, 6, 8, 12, 16, 24, 48; factors of 60 = 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60) and choose the greatest factor that exactly divides both 48 and 60, i.e., 12.

What is the Relation Between LCM and GCF of 48, 60?

The following equation can be used to express the relation between LCM and GCF of 48 and 60, i.e. GCF × LCM = 48 × 60.

How to Find the GCF of 48 and 60 by Prime Factorization?

To find the GCF of 48 and 60, we will find the prime factorization of the given numbers, i.e. 48 = 2 × 2 × 2 × 2 × 3; 60 = 2 × 2 × 3 × 5. ⇒ Since 2, 2, 3 are common terms in the prime factorization of 48 and 60. Hence, GCF(48, 60) = 2 × 2 × 3 = 12

☛ What is a Prime Number?

How to Find the GCF of 48 and 60 by Long Division Method?

To find the GCF of 48, 60 using long division method, 60 is divided by 48. The corresponding divisor (12) when remainder equals 0 is taken as GCF.

If the GCF of 60 and 48 is 12, Find its LCM.

GCF(60, 48) × LCM(60, 48) = 60 × 48 Since the GCF of 60 and 48 = 12 ⇒ 12 × LCM(60, 48) = 2880 Therefore, LCM = 240

☛ Greatest Common Factor Calculator

What are the Methods to Find GCF of 48 and 60?

There are three commonly used methods to find the GCF of 48 and 60.

• By Euclidean Algorithm
• By Prime Factorization
• By Long Division

What divided by 48 equals 60?

What divided by 48 equals 61?

In order to continue enjoying our site, we ask that you confirm your identity as a human. Thank you very much for your cooperation.

Menu

Is the number 60 divisible by 48?

A natural number 'A' could only be divisible by another number 'B' if after dividing 'A' by 'B' the remainder was zero.

60 would be divisible by 48 only if there was a natural number 'n', so that:
60 = 'n' × 48

When we divide the two numbers, there is a remainder:

60 ÷ 48 = 1 + remainder 12

There is no natural number 'n' such that: 60 = 'n' × 48.

The number 60 is not divisible by 48.

1) If you subtract the remainder of the above operation from the original number, 60, then the result is a number that is divisible by the second number, 48:

60 - 12 = 48

48 = 1 × 48

2) If you subtract the remainder of the above operation from the second number, 48, and then add the result to the original number, 60, you get a number that is divisible by the second number:

48 - 12 = 36

60 + 36 = 96.

96 = 2 × 48.

The number 60 would be divisible by 48 only if its prime factorization contained all the prime factors that appear in the prime factorization of the number 48.

The prime factorization of a number: finding the prime numbers that multiply together to make that number.

60 = 22 × 3 × 5
60 is not a prime number but a composite one.

48 = 24 × 3
48 is not a prime number but a composite one.

* The natural numbers that are only divisible by 1 and themselves are called prime numbers. A prime number has exactly two factors: 1 and itself.
* A composite number is a natural number that has at least one other factor than 1 and itself.

The prime factorization of the number 60 does not contain (all) the prime factors that occur in the prime factorization of 48.

The number 60 is not divisible by 48.

The number 60 is not divisible by 48. When the two numbers are divided, there is a remainder. The prime factorization of the number 60 does not contain (all) the prime factors that occur in the prime factorization of 48.

The divisibility of the natural numbers:

Method 1: Divide the numbers and check the remainder of the operation. If the remainder is zero, then the numbers are divisible.

Method 2: The prime factorization of the numbers (the decomposition of the numbers into prime factors).

• One natural number is said to be divisible by another natural number if after dividing the two numbers, the remainder of the operation is zero.
• Example: Let's divide two different numbers: 12 and 15, by 4.
• When dividing 12 by 4, the quotient is 3 and the remainder of the operation is zero.
• But when we divide 15 by 4, the quotient is 3 and the operation leaves a remainder of 3.
• We say that the number 12 is divisible by 4 and 15 is not divisible by 4.
• We also say that 4 is a divisor, or a factor, of 12, but not a factor (divisor) of 15.

• We say that the number "a" is divisible by "b", if there is an integer number "n", such that:
• a = n × b.
• The number "b" is called a divisor (or a factor) of "a" ("n" is also a divisor, or a factor, of "a").

• 0 is divisible by any number other than itself.
• 1 is a divisor (a factor) of every number.
• Improper factors: Any number "a", different of zero, is divisible at least by 1 and itself. In this case the number itself, "a", is called an improper factor (or an improper divisor). Some also consider 1 as an improper factor (divisor).
• Prime numbers: A number which is divisible only by 1 and itself is also called a prime number.
• Coprime numbers: If the greatest common factor of two numbers, "m" and "n", the GCF (m; n) = 1 - then it means that the two numbers are coprime, in other words they have no divisor other than 1. If a number "a" is divisible by these two coprime numbers, "m" and "n", then "a" is also divisible by their product, (m × n).
  • Example:
  • The number 84 is divisible by 4 and 3 and is also divisible by 4 × 3 = 12.
  • This is true because the two divisors, 3 and 4, are coprime.

• Calculating the divisors (factors) of a number is very useful when simplifying fractions (reducing fractions to lower terms).
• The established rules for finding factors (divisors) are based on the fact that the numbers are written in the decimal system:
• Multiples of 10 are divisible by 2 and 5, because 10 is divisible by 2 and 5
• Multiples of 100 are divisible by 4 and 25, because 100 is divisible by 4 and 25
• Multiples of 1,000 are divisible by 8, because 1,000 is divisible by 8.
• All the powers of 10, when divided by 3, or 9, have a remainder equal to 1.

• Due to the rules of operations with remainders, we have the following remainders when dividing numbers by 3 or 9:
• 600 leaves a remainder equal to 6 = 1 × 6 (1 for every 100)
• 240 = 2 × 100 + 4 × 10, then the remainder will be equal to 2 × 1 + 4 × 1 = 6

• When a number is divided by 3 or 9, the remainder is equal to what you get by dividing the sum of the digits of that number by 3 or 9:
• 7,309 has the sum of its digits: 7 + 3 + 0 + 9 = 19, which is divided with a remainder by either 3 or 9. So 7,309 is divisible by neither 3 nor by 9.

• All the even powers of 10, such as 102 = 100, 104 = 10,000, 106 = 1,000,000, and so on, when divided by 11 have a remainder equal to 1.
• All the odd powers of 10, such as 101 = 10, 103 = 1,000, 105 = 100,000, 107 = 10,000,000, and so on, when divided by 11 have a remainder equal to 10. In this case, the alternating sum of the digits of the number has the same remainder as the number itself when divided by 11.
• How is the alternating sum of the digits being calculated - it is shown in the example below.

• For instance, for the number: 85,976: 6 + 9 + 8 = 23, 7 + 5 = 12, the alternating sum of the digits: 23 - 12 = 11. So 85,976 is divisible by 11.

• 2, if the last digit is divisible by 2. If the last digit of a number is 0, 2, 4, 6 or 8, then the number is divisible by 2. For example, the number 20: 0 is divisible by 2, so then 20 must be divisible by 2 (indeed: 20 = 2 × 10).
• 3, if the sum of the digits of the number is divisible by 3. For example, the number 126: the sum of the digits is 1 + 2 + 6 = 9, which is divisible by 3. Then the number 126 must also be divisible by 3 (indeed: 126 = 3 × 42).
• 4, if the last two digits of the number make up a number that is divisible by 4. For example 124: 24 is divisible by 4 (24 = 4 × 6), so 124 is also divisible by 4 (indeed: 124 = 4 × 31).
• 5, if the last digit is divisible by 5 (the last digit is 0 or 5). For example 100: the last digit, 0, is divisible by 5, then the number 100 must be divisible by 5 (indeed: 100 = 5 × 20).
• 6, if the number is divisible by both 2 and 3. For example, the number 24 is divisible by 2 (24 = 2 × 12) and is also divisible by 3 (24 = 3 × 8), then it must be divisible by 6. Indeed, 24 = 6 × 4.
• 7, if the last digit of the number (the unit digit), doubled, subtracted from the number made up of the rest of the digits gives a number that is divisible by 7. The process can be repeated until a smaller number is obtained. For example, is the number 294 divisible by 7? We apply the algorithm: 29 - (2 × 4) = 29 - 8 = 21. 21 is divisible by 7. 21 = 7 × 3. But we could have applied the algorithm again, this time on the number 21: 2 - (2 × 1) = 2 - 2 = 0. Zero is divisible by 7, so 21 must be divisible by 7. If 21 is divisible by 7, then 294 must be divisible by 7.
• 8, if the last three digits of the number are making up a number that is divisible by 8. For example, the number 2,120: 120 is divisible by 8 since 120 = 8 × 15. Then 2,120 must also be divisible by 8. Proof: if we divide the numbers, 2,120 = 8 × 265.
• 9, if the sum of the digits of the number is divisible by 9. For example, the number 270 has the sum of the digits equal to 2 + 7 + 0 = 9, which is divisible by 9. Then 270 must also be divisible by 9. Indeed: 270 = 9 × 30.
• 10, if the last digit of the number is 0. Example, 140 is divisible by 10, since 140 = 10 × 14.
• 11 if the alternating sum of the digits is divisible by 11. For example, the number 2,915 has the alternating sum of the digits equal to: (5 + 9) - (1 + 2) = 14 - 3 = 11, which is divisible by 11. Then the number 2,915 must also be divisible by 11: 2,915 = 11 × 265.
• 25, if the last two digits of the number are making up a number that is divisible by 25. For example, the number made up by the last two digits of the number 275 is 75, which is divisible by 25, since 75 = 25 × 3. Then 275 must also be divisible by 25: 275 = 25 × 11.

What is a prime number? Definition, examples

What is a composite number? Definition, examples

The prime numbers up to 1,000

The prime numbers up to 10,000

The Sieve of Eratosthenes

The Euclidean Algorithm

Completely reduce (simplify) fractions to the lowest terms: Steps and Examples