What is the relation between EXPTIME and NP HARD complexity classes?

Need to know the relation between EXPTIME and NP HARD complexity classes.

There are NP-hard problems that are not in EXPTIME and vice versa. This is to be expected as NP-hard is defined by a lower bound and EXPTIME mainly by an upper bound. NP is contained in EXPTIME, however, and NP-complete is of course contained in NP.

StackExchange Computer Science Q#62449, answer score: 9