1150231435536 has 160 divisors (see below), whose sum is σ = 3090687897600. Its totient is φ = 368215948800.

The previous prime is 1150231435489. The next prime is 1150231435547. The reversal of 1150231435536 is 6355341320511.

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

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, 382008271 + ... + 382011281.

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

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

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1150231435536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1545343948800).

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

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

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

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

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

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

The spelling of 1150231435536 in words is "one trillion, one hundred fifty billion, two hundred thirty-one million, four hundred thirty-five thousand, five hundred thirty-six".