для бинарных чисел нет признака делимости на 5
First split the number into odd and even bits (I'm calling "even" the bits corresponding to even powers of 2):
100100110010110000000101101110 0 1 0 1 0 0 1 0 0 0 1 1 0 1 0 even 1 0 0 1 0 1 1 0 0 0 0 0 1 1 1 odd
Now in each of these, add and subtract the digits alternately, as in the standard test for divisibility by 11 in decimal (starting with addition at the right):
100100110010110000000101101110 +0-1+0-1+0-0+1-0+0-0+1-1+0-1+0 = -2 +1-0+0-1+0-1+1-0+0-0+0-0+1-1+1 = 1
Now double the sum of the odd digits and add it to the sum of the even digits:
2*1 + -2 = 0
If the result is divisible by 5, as in this case, the number itself is divisible by 5.
Since this number is also divisible by 2 (the rightmost digit being 0), it is divisible by 10.