11050603315140 has 24 divisors (see below), whose sum is σ = 30941689282560. Its totient is φ = 2946827550688.

The previous prime is 11050603315121. The next prime is 11050603315201. The reversal of 11050603315140 is 4151330605011.

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 = 11050603315098 and 11050603315107.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92088360900 + ... + 92088361019.

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

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

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

It is an amenable number.

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

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

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

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

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

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

The spelling of 11050603315140 in words is "eleven trillion, fifty billion, six hundred three million, three hundred fifteen thousand, one hundred forty".