16501015665 has 48 divisors (see below), whose sum is σ = 28752197760. Its totient is φ = 8754393600.

The previous prime is 16501015651. The next prime is 16501015667. The reversal of 16501015665 is 56651010561.

16501015665 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 16501015665 - 2⁷ = 16501015537 is a prime.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7920714 + ... + 7922796.

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

Almost surely, 2^16501015665 is an apocalyptic number.

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

It is an amenable number.

16501015665 is a deficient number, since it is larger than the sum of its proper divisors (12251182095).

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 36.

The spelling of 16501015665 in words is "sixteen billion, five hundred one million, fifteen thousand, six hundred sixty-five".