105032153040232 has 32 divisors (see below), whose sum is σ = 214847279287200. Its totient is φ = 47739935649600.

The previous prime is 105032153040187. The next prime is 105032153040233. The reversal of 105032153040232 is 232040351230501.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22235694 + ... + 26542237.

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

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 31.

The spelling of 105032153040232 in words is "one hundred five trillion, thirty-two billion, one hundred fifty-three million, forty thousand, two hundred thirty-two".