A sum of Power n divisor cordial labeling of a graph G with vertex set V is a bijection ????: ???? → {1,2,3, … , |????(????)|} such that an edge ???????? is assigned the label 1 if 2 divides (????(????) + ????(????)) ???? and 0 otherwise. The number of edges labeled with 0 and the number of edges labeled with 1 differ atmost 1. A graph with a sum of power n divisor cordial labeling is called a sum of power n divisor cordial graph. We establish in this paper that subdivision of some standard graphs are sum of power n divisor cordial graphs