Any one knows answer?

The binary string 0011011 is a member of which of the following problems? Remember, a "problem" is a language whose strings represent the cases of a problem that have the answer "yes." In this question, you should assume that all languages are sets of binary strings interpreted as base-2 integers. The exception is the problem of finding palindromes, which are strings that are identical when reversed, like 0110110, regardless of their numerical value. a) Is the given string a composite number (not a prime)? b) Is the given string not a multiple of 3? c) Is the given string a palindrome? d) Is the given string greater than 50