answersLogoWhite

0

A number is divisible by 4 if the last two digits are divisible by 4.

A number is divisible by 4 if the last two digits are divisible by 4.

A number is divisible by 4 if the last two digits are divisible by 4.

A number is divisible by 4 if the last two digits are divisible by 4.

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine
ReneRene
Change my mind. I dare you.
Chat with Rene
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
More answers

A number is divisible by 4 if the last two digits are divisible by 4.

User Avatar

Wiki User

15y ago
User Avatar

Add your answer:

Earn +20 pts
Q: A number is divisible by 4 if the tens and one digits.?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

Is 473 divisible by 7?

There is no easy test for divisibility by 7, it is often just as quick, if not quicker, to do the division than any devised test. One test I can suggest: 1) split the number into blocks of 3 digits starting from the right hand end (just like when inserting commas to make a number easier to read); 2) Separately sum the units digits, tens digits and hundreds digits of each block by alternately subtracting and adding starting from the right hand end; 3) Add the sum of the units digits to 3 times the sum of the tens digits to twice the sum of the hundreds digits; 4) if the sum in step 4 is divisible by 7, then so is the original number. got 473: 3 +3×7 + 2×4 = 32 which is not divisible by 7, so 473 is not divisible by 7.


What is the one 9 digit delectable number which can be made using the digits 1 to 9?

A delectable number has nine digits, using the numbers 1-9 once in each digit. The first digit of a delectable number must be divisible by one. The first and second digits must be divisible by two, the first through third must be divisible by three, etc. There has only been one delectable number discovered: 381654729.


Is the number 1859 a prime number?

To find out if 1859 is a prime number, use the rules of division:1859 is not an even number, so it is not divisible by 2.The digits of 1859 add up to a number that is divisible by 3, so it is not divisible by 3.The last two digits (59) is not divisible by 4, so neither is 1859.The last digit is not 5, so it is not divisible by 5.1859 is not divisible by 2 and it is not divisible by 3, so it is not divisible by 6.When you double the last digit (9 doubled is 18), and subtract that number from the rest of the number (859 - 18 = 841), if the answer is 0 or divisible by 7, the number itself is divisible by 7. If you can't readily tell if the number is divisible by 7, you can do the steps again. Starting with 841, doubling the 1 is still 1, so take 1 away from 84 to get 83. 83 is not divisible by 7, so neither is 1859.The last three digits (859) are not divisible by 8, so 1859 is not divisible by 8.If the sum of the digits is divisible by 9, the number is divisible by 9. The sum of the digits is 23, which is not divisible by 9.1859 does not end with a 0, so it is not divisible by 10.If the sum of every second digit (8 + 9) minus the sum of the other digits (1 + 5) equals 0 or is divisible by 11, the number itself is divisible by 11. 17 - 6 = 11, so 1859 is divisible by 11.Since 1859 is divisible by 11, it is a composite number (a number that has at least three factors: 1, the number itself, and at least one oher factor).


What are the divisibility rules for numbers 4 6 and 8?

For 4:Are the last two digits in your number divisible by 4? If so, the number is too! For example: 358912 ends in 12 which is divisible by 4, thus so is 358912. For 6: The number must be divisible by 2 and 3. For 8: This one's not as easy, if the last 3 digits are divisible by 8, so is the entire number. Example: 6008 - The last 3 digits are divisible by 8, therefore, so is 6008.


What is a number whose tens digit 2 greater than its units digits?

97 is one example.