105006156015112 has 128 divisors (see below), whose sum is σ = 218632605408000. Its totient is φ = 46882545909760.

The previous prime is 105006156015091. The next prime is 105006156015119. The reversal of 105006156015112 is 211510651600501.

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

It is not an unprimeable number, because it can be changed into a prime (105006156015119) 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 31 ways as a sum of consecutive naturals, for example, 2219557314 + ... + 2219604622.

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

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

It is an amenable number.

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

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

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

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

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

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

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

The spelling of 105006156015112 in words is "one hundred five trillion, six billion, one hundred fifty-six million, fifteen thousand, one hundred twelve".