Given a nontrivial graph, a set of vertices of a graph is an independent set if every pair of distinct vertices are not adjacent and it is a 2-dominating set if each vertex in its complement is adjacent to at least two vertices in the set. A set of vertices of a graph is an independent 2-dominating set if it is both an independent set and a 2-dominating set. The independent 2-domination number of a nontrivial graph is the cardinality of a minimum independent 2-dominating set. In this paper, we c