  In this article we investigate normalized adjacency eigenvalues (simply
normalized eigenvalues) and normalized adjacency energy of connected threshold
graphs. A threshold graph can always be represented as a unique binary string.
Certain eigenvalues are obtained directly from its binary representation and
the rest of the eigenvalues are evaluated from its normalized equitable
partition matrix. Finally, we characterize threshold graphs with at most five
distinct eigenvalues.
