The total chromatic numberχT(H)of hypergraph H is the minimum number of colors needed to color the vertices and edges of H so that the incident or adjacent elements have distinct colors.The total coloring of hypergraph contains weak total coloring and strong total coloring.This paper will give the weak total chromatic number of star χWT(S(v))=Δ+1,the strong total chromatic number χST(S(v))=M+1 and the enumeration of star.