Instead of dividing by 16 repeatedly, we can convert 2000 to binary first and group the binary digits into sets of four to read off the hexadecimal digits directly, then check this against each option.
\( 2000 = 1024+512+256+128+64+16 = 2^{10}+2^9+2^8+2^7+2^6+2^4 \), giving the binary string \( 11111010000 \). Grouping into 4-bit nibbles from the right: \( 0111\ 1101\ 0000 \). Converting each nibble: \( 0111=7 \), \( 1101=13=D \), \( 0000=0 \). So the hexadecimal representation is \( 7D0 \).
Only \( 7D0 \) reconstructs to exactly \( 2000 \) when converted back to decimal, confirming both the binary-grouping derivation and the option check agree.
Therefore, the correct answer is 7D0.