101101000011111 has 64 divisors (see below), whose sum is σ = 156467079521280. Its totient is φ = 64397773440000.

The previous prime is 101101000011103. The next prime is 101101000011149. The reversal of 101101000011111 is 111110000101101.

It is not a de Polignac number, because 101101000011111 - 2³ = 101101000011103 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101101000011161) 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, 2308167411 + ... + 2308211211.

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

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

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 9.

Adding to 101101000011111 its reverse (111110000101101), we get a palindrome (212211000112212).

The spelling of 101101000011111 in words is "one hundred one trillion, one hundred one billion, eleven thousand, one hundred eleven".