156905133 has 32 divisors (see below), whose sum is σ = 263181312. Its totient is φ = 80774400.

The previous prime is 156905117. The next prime is 156905137. The reversal of 156905133 is 331509651.

It is not a de Polignac number, because 156905133 - 2⁴ = 156905117 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (33).

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (156905137) 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, 23098 + ... + 29108.

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

Almost surely, 2^156905133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6145.

The product of its (nonzero) digits is 12150, while the sum is 33.

The square root of 156905133 is about 12526.1779086839. The cubic root of 156905133 is about 539.3603915424.

The spelling of 156905133 in words is "one hundred fifty-six million, nine hundred five thousand, one hundred thirty-three".