1016015151151 has 64 divisors (see below), whose sum is σ = 1376477254656. Its totient is φ = 730246112640.

The previous prime is 1016015151149. The next prime is 1016015151181. The reversal of 1016015151151 is 1511515106101.

It is not a de Polignac number, because 1016015151151 - 2¹ = 1016015151149 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 226130661 + ... + 226135153.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 750, while the sum is 28.

The spelling of 1016015151151 in words is "one trillion, sixteen billion, fifteen million, one hundred fifty-one thousand, one hundred fifty-one".