18916311040 has 192 divisors, whose sum is σ = 50734298160. Its totient is φ = 6710886400.

The previous prime is 18916310957. The next prime is 18916311047. The reversal of 18916311040 is 4011361981.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (18916311047) by changing a digit.

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

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

Almost surely, 2^18916311040 is an apocalyptic number.

18916311040 is a gapful number since it is divisible by the number (10) 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 18916311040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25367149080).

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

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

18916311040 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 5184, while the sum is 34.

The spelling of 18916311040 in words is "eighteen billion, nine hundred sixteen million, three hundred eleven thousand, forty".