To find the remainder when 987654321 is divided by 9, we can use the divisibility rule for 9.
The rule states that a number is divisible by 9 if the sum of its digits is divisible by 9. The remainder when a number is divided by 9 is the same as the remainder when the sum of its digits is divided by 9.
First, calculate the sum of the digits of the number 987654321:
Sum = $9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1$
Sum = $45$
Next, find the remainder when this sum (45) is divided by 9:
Remainder = $45 \pmod{9}$
Since $45 = 9 \times 5$, the remainder is 0.
Therefore, the remainder when 987654321 is divided by 9 is 0.
What least value must be assigned to '*' so that the number 63576*2 is divisible by 8?
When a number is divided by 56, the remainder will be 29. If the same number is divided by 8, then the remainder will be
If a perfect square, not divisible by 6, be divided by 6, the remainder will be
The least number that must be added to 8961 to make it exactly divisible by 84 is
What is the remainder when 6910 is divided by 81?
If 27N4 is divisible by 11, then what is the value of N?
What least value must be assigned to ' * ' so that the numbers 451 * 603 is exactly divisible by 9?
In a division problem, the divisor is 4 times the quotient and 2 times the remainder. If the remainder is 32, then find the dividend.
Find the remainder, if 19200 is divided by 20.
A seller sold 19 cookies for ₹95 instead of 20 cookies in one kg, cheating a customer. What is the gain (in ₹) if the seller bought the cookies for ₹76?
If all positive divisors of 132 are arranged in descending order, then what digit will be at unit place of first divisor ?
If 3 2019 is divided by 10, then what is the remainder?
The number 3798125P369 is divisible by 7. What is the value of the digit P?
Consider all 3-digit numbers (without repetition of digits) obtained using three non-zero digits which are multiples of 3. Let S be their sum.
Which of the following is/are correct?
1. S is always divisible by 74.
2. S is always divisible by 9.
select the correct answer using the code given below:
How many 3-digit natural numbers (without repetition of digits) are there such that each digit is odd and the number is divisible by 5?