In this paper, we construct many Hadamard matrices of order and we use a new efficient algorithm to investigate the lower bound of inequivalent Hadamard matrices of order . Using four -circulant matrices of order in the Goethals-Seidel array, we obtain many new Hadamard matrices of order and we show that there are at least inequivalent Hadamard matrices for this order. Moreover, we use a known method to investigate the existence of double even self-dual codes over constructed from these Hadamard matrices.