Can number of states in DFA be greater than $2^n$ when language-equivalent NFA has $n$ states?
it surely can, but it needs not. Using the powerset construction you can convert any $n$-state NFA into a DFA with at most $2^n$ states.