16511056761140 has 48 divisors (see below), whose sum is σ = 34761450507840. Its totient is φ = 6587618419200.

The previous prime is 16511056761091. The next prime is 16511056761181. The reversal of 16511056761140 is 4116765011561.

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

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 211199699 + ... + 211277861.

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

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

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 44.

The spelling of 16511056761140 in words is "sixteen trillion, five hundred eleven billion, fifty-six million, seven hundred sixty-one thousand, one hundred forty".