A proper $[k]$-total coloring $c$ of a graph $G$ is a mapping $c$ from $V(G)\bigcup E(G)$ to $[k]=\{1,2,\cdots,k\}$ such that $c(x)\neq c(y)$ for which $x$, $y\in V(G)\bigcup E(G)$ and $x$ is adjacent to or incident with $y$. Let $\prod(v)$ denote the product of $c(v)$ and the colors on all the edges incident with $v$. For each edge $uv\in E(G)$, if $\prod(u)\neq \prod(v)$, then the coloring $c$ is called a neighbor product distinguishing total coloring of $G$. we use $χ"_{\prod}(G)$ to denote the minimal value of $k$ in such a coloring of $G$. In 2015, Li et al. conjectured that $Δ(G)+3$ colors enable a graph to have a neighbor product distinguishing total coloring. In this paper, we consider the neighbor product distinguishing total coloring of corona product $G\circ H$, and obtain that $χ"_{\prod}(G\circ H)\leq Δ(G\circ H)+3$.