105611105611050 has 288 divisors, whose sum is σ = 295136626005312. Its totient is φ = 24841344245760.

The previous prime is 105611105610961. The next prime is 105611105611069. The reversal of 105611105611050 is 50116501116501.

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

It is an unprimeable number.

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 143 ways as a sum of consecutive naturals, for example, 158743197 + ... + 159407103.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 33.

Adding to 105611105611050 its reverse (50116501116501), we get a palindrome (155727606727551).

The spelling of 105611105611050 in words is "one hundred five trillion, six hundred eleven billion, one hundred five million, six hundred eleven thousand, fifty".