Multiprime RSA is a variant of RSA, where the modulus is the product of three or more prime numbers. In this paper, we attack Multiprime RSA. Our attack assumes that many instances of Multiprime RSA all use different moduli, but somehow all use the same secret exponent. Our attack generalizes the existing attack on RSA by Hinek. We use lattice reduction techniques to recover the bound for secret exponent.