How many languages exist with input alphabet {0,1} and all strings in the language have length less than or equal to 5?
First, you seem to have missed the empty string, so there are actually 63 possible strings. In any language, each of the 63 strings could either be in or not in the language, so there will be a total of $2^{63}$ different languages. In the jargon, that's a BFN.