The general neighbor-distinguishing total chromatic number of a graph is the smallest integer such that the vertices and edges of can be colored by colors so that no adjacent vertices have the same set of colors. It is proved in this note that , where is the vertex chromatic number of .