156401012151 has 12 divisors (see below), whose sum is σ = 225944759040. Its totient is φ = 104252486400.

The previous prime is 156401012149. The next prime is 156401012177. The reversal of 156401012151 is 151210104651.

156401012151 is a `hidden beast` number, since 1 + 5 + 640 + 1 + 0 + 1 + 2 + 15 + 1 = 666.

156401012151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 156401012151 - 2¹ = 156401012149 is a prime.

It is a super-2 number, since 2×156401012151² (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (156401012111) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1171050 + ... + 1297751.

It is an arithmetic number, because the mean of its divisors is an integer number (18828729920).

Almost surely, 2^156401012151 is an apocalyptic number.

156401012151 is a deficient number, since it is larger than the sum of its proper divisors (69543746889).

156401012151 is a wasteful number, since it uses less digits than its factorization.

156401012151 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2475846 (or 2475843 counting only the distinct ones).

The product of its (nonzero) digits is 1200, while the sum is 27.

The spelling of 156401012151 in words is "one hundred fifty-six billion, four hundred one million, twelve thousand, one hundred fifty-one".