If you look at the description carefully, rules can be of any length equal to an odd number (1,3,5...). Your solution assumes that rules are always length 3, thus failing the tests with different rule length. Try again!

Moreover your message could be considered as a spoiler since you gave one method that can be used to solve the kata. Please use a spoiler flag when doing this (I set it for you this time).

Not an issue. You must compare bits, as it is clearly stated, and that doesn't depend on the method you use to get the binary representation (btw you don't even need to actually convert numbers to a binary representation to solve it).

Which language are you using?