An upper bound for the search number of the Cartesian product $G_1+G_2$ is determined, where the search numbers of the graphs $G_1$ and $G_2$ are $s(G_1)$ and $s(G_2)$, respectively. Using this, some estimates for the search numbers of $n$-cubes are obtained, for $n$ natural.