11015001556050 has 48 divisors (see below), whose sum is σ = 27480779992512. Its totient is φ = 2919744916800.

The previous prime is 11015001556049. The next prime is 11015001556063. The reversal of 11015001556050 is 5065510051011.

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

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 219835261 + ... + 219885360.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 3750, while the sum is 30.

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