101010011101110 has 192 divisors, whose sum is σ = 272543196744000. Its totient is φ = 25934152237056.

The previous prime is 101010011101049. The next prime is 101010011101123. The reversal of 101010011101110 is 11101110010101.

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

101010011101110 is a modest number, since divided by 11101110 gives 1010100 as remainder.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2858297821 + ... + 2858333159.

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

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

101010011101110 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 101010011101110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136271598372000).

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

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

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

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

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

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

Adding to 101010011101110 its reverse (11101110010101), we get a palindrome (112111121111211).

The spelling of 101010011101110 in words is "one hundred one trillion, ten billion, eleven million, one hundred one thousand, one hundred ten".