Is it decidable whether a TM is a LBA?
An LBA is limited to working only on the space defined by the input. That means it won't ever move right on reading a blank space (if your model doesn't allow writing blank, only a fake blank, that is). That is easy to check by looking at the transitions of the TM.
To check if the language is accepted by an LBA is undecidable by Rice's theorem.