The Radial graph of a graph $G$, denoted by $R(G)$, has the same vertex set as $G$ with an edge joining vertices $u$ and $v$ if $d(u, v)$ is equal to the radius of $G$. This definition is extended to a digraph $D$ where the arc $(u, v)$ is included in $R(D)$ if $d(u, v)$ is the radius of $D$. A digraph $D$ is called a Radial digraph if $R(H)=D$ for some digraph $H$. In this paper, we shown that if $D$ is a radial digraph of type 2 then $D$ is the radial digraph of itself or the radial digraph of its complement. This generalizes a known characterization for radial graphs and provides an improved proof. Also, we characterize self complementary self radial digraphs.