A proper total coloring of a graph G is an assignment of colors to the vertices and edges of G (together called the elements of G) such that neighbored elements-two adjacent vertices or two adjacent edges or a vertex and an incident edge-are colored differently. The total chromatic number 00(G) of G is defined as the minimum number of colors in a proper total coloring of G. In this paper, we study the stability of the total chromatic number of a graph with respect to two operations, namely removing edges and subdividing edges, which leads to the following two invariants. (i) The total chromatic edge stability number or 00-edge stability number es 00 (G) is the minimum number of edges of G whose removal results in a graph H G with 00(H) 6= 00(G) or with E(H) = ;. (ii) The total chromatic subdivision number or 00-subdivision number sd 00 (G) is the minimum number of edges of G whose subdivision results in a graph H G with 00(H) 6= 00(G) or with E(H) = ;. We prove general lower and upper bounds for es 00 (G). Moreover, we determine es 00 (G) and sd 00 (G) for some classes of graphs.