115156515161010 has 64 divisors (see below), whose sum is σ = 293126506497792. Its totient is φ = 28853288595456.

The previous prime is 115156515160969. The next prime is 115156515161033. The reversal of 115156515161010 is 10161515651511.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 115156515161010.

It is an unprimeable number.

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

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

Almost surely, 2^{115156515161010} is an apocalyptic number.

115156515161010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

115156515161010 is an abundant number, since it is smaller than the sum of its proper divisors (177969991336782).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

115156515161010 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 380771427.

The product of its (nonzero) digits is 22500, while the sum is 39.

The spelling of 115156515161010 in words is "one hundred fifteen trillion, one hundred fifty-six billion, five hundred fifteen million, one hundred sixty-one thousand, ten".