151056567151 has 32 divisors (see below), whose sum is σ = 178292994048. Its totient is φ = 125274988800.

The previous prime is 151056567121. The next prime is 151056567209. The reversal of 151056567151 is 151765650151.

It is a cyclic number.

It is not a de Polignac number, because 151056567151 - 2¹¹ = 151056565103 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 151056567098 and 151056567107.

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 77424226 + ... + 77426176.

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

Almost surely, 2^151056567151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3511.

The product of its (nonzero) digits is 157500, while the sum is 43.

The spelling of 151056567151 in words is "one hundred fifty-one billion, fifty-six million, five hundred sixty-seven thousand, one hundred fifty-one".