The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node attracts a new node with probability $p$, or fails to do with probability $1-p$. Here, we investigate the number of protected nodes, total path length of protected nodes, and a mean study of the protected node profile of such trees.