First of all LL(1) can't be compared like wise as you mentioned because it parse through TOP DOWN APPROACH without back tracking where as Left recursion and Non determinism is not allowed.
But a grammar could be LR(0),SLR(1),CLR(1), LALR(1)
But when a grammar is Ambiguous no parser be possible.
Q.Can we say that if a language is not parsed by powerful parser then less powerful parsers can't parse that language?
Ans. May or May not, except LALR(1) parser.
Suppose CLR(1) can't parse a grammar, it means there exist a Conflicts(SR or RR), but it does not mean that the grammar can't be parsed by LR(0), SLR(1), but LALR(1) can't be parsed absolutely correct.