11000505500050 has 48 divisors (see below), whose sum is σ = 22380868014912. Its totient is φ = 3989459390400.

The previous prime is 11000505500011. The next prime is 11000505500087. The reversal of 11000505500050 is 5000550500011.

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

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

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

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, 26605734 + ... + 27016033.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 625, while the sum is 22.

The spelling of 11000505500050 in words is "eleven trillion, five hundred five million, five hundred thousand, fifty".