how can i find that a big number can be divided by 16?

Answer 1

Mulitiply any other number by 16. The result will be divisible by 16.

Answer 2

16 x 16

Answer 3

Try dividing the number by 16?

Answer 4

Times 16 by a big number.

Answer 5

Mulpiply a big number by 16

Answer 6

Divide by 4 and if you get a whole answer divide that by 4. If you get a second whole number then the original is divisible by 16.

Answer 7

You just need to see if the last four digits form a number that is divisible by 16. This is because 10,000 is divisible by 16. 10,000 = 16 * 625. So look at a large number like 3450000. It ends in four zeroes, so it's a multiple of 10,000, so it's divisible by 16. Now look at 3451024. That's 3450000 + 1024. You know that 3450000 is divisible by 16. If you add a multiple of 16, the whole number is still a multiple of 16. If you add any number that is not a multiple of 16, you no longer have a multiple of 16. 1024 = 16 * 64, so 3451024 is a multiple of 16. So is 983298398730128. Look at the last four digits; they are 0128, or the three digit number 128. 128 = 16 * 8. Now look at 34789101303420015. The last four digits are 0015, or the two digit number 15. That's certainly not divisible by 16, so this number is not divisible by 16.

Note that 16 = 2^4, and this rule works to check divisibility for all powers of 2, but you have to look at as many digits as the exponent of 2. To check for divisibility by 8, which is 2^3, you only need to check the last three digits. To check for divisibility by 32 = 2^5, you need to check the last five digits.

(The question wasn't how to find a large number that is divisible by 16, but rather to start with a large number and see if it is divisible by 16.)

Answer 8

Multiply a big number by 16 and that answer can be divided by 16.

Answer 9

Press divide by 16 on your calculator then see if you get a whole number

Answer 10

The last four digits must be a multiple of 16.

And how do you see that?
* Split the last four digits into two pairs:
... 65536 --> 55 36

* Divide the first pair by four;
take the remainder:
... 55 / 4 = 13, remander 3

* The last pair must be a multiple of four.
... 36 / 4 = 9, check.

* Add the remainder to the quotient:
... 3 + 6 = 12

* This must be a multiple of 4.

-------------------------------------------
Additional example:

26347892504988
... 49 88
... rem:1 quot:22
1 + 22 = 23 --> fail

178288
... 82 88
... rem:2 quot:22
2 + 22 = 24 --> success

123456789104
... 91 04
... rem:3 quot:1
1 + 3 = 4 --> success

Answer 11

the best way is to use a modulus computer function

if (mod(big number, 16) ==0) then

it can be divided by 16


(mod divides the 1st number by the 2nd and returns the remainder)

(== is a condition for checking equality)