A multi-input erasure channel is defined as the J(J+1) discrete memoryless channel, for which we study a capacity formula, through the method by Muroga. We first give a simpler capacity formula for the multi-input erasure channel with no cross probability. Next we give an upper bound to the capacity for the general case. Finally we remark that the upper bound is actually the capacity when the cross probability is small.