Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $δ_{D^G} = ρ_1 - ρ_2$, where $ρ_1$ and $ρ_2$ represent the largest and second largest eigenvalues of $D(G)$, respectively. For a $k$-transmission regular graph $G$, the second smallest eigenvalue of the distance Laplacian matrix equals the distance spectral gap of $G$. In this article, we obtain some upper and lower bounds for the distance spectral gap of a graph in terms of the sum of squares of its distance eigenvalues. Additionally, we provide some bounds for the distance eigenvalues and distance energy of graphs. Furthermore, we construct new families of non $D$-cospectral $D$-equienergetic graphs with diameters of $3$ and $4$.