105010066115152 has 160 divisors (see below), whose sum is σ = 248621194368000. Its totient is φ = 42345794304000.

The previous prime is 105010066115113. The next prime is 105010066115177. The reversal of 105010066115152 is 251511660010501.

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

It is a Harshad number since it is a multiple of its sum of digits (34).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6671527 + ... + 15953977.

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

Almost surely, 2^{105010066115152} 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 105010066115152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124310597184000).

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

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

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

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

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

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

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