15662161650 has 96 divisors (see below), whose sum is σ = 40661647488. Its totient is φ = 3982105600.

The previous prime is 15662161639. The next prime is 15662161657. The reversal of 15662161650 is 5616126651.

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

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

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 47 ways as a sum of consecutive naturals, for example, 1086490 + ... + 1100810.

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

Almost surely, 2^15662161650 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 15662161650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20330823744).

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

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

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

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

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

The product of its (nonzero) digits is 64800, while the sum is 39.

The spelling of 15662161650 in words is "fifteen billion, six hundred sixty-two million, one hundred sixty-one thousand, six hundred fifty".