10100111111010 has 192 divisors, whose sum is σ = 27207675480960. Its totient is φ = 2598064634880.

The previous prime is 10100111110993. The next prime is 10100111111011. The reversal of 10100111111010 is 1011111100101.

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 = 10100111110983 and 10100111111001.

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

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

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

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

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

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

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

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

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

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

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

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

Adding to 10100111111010 its reverse (1011111100101), we get a palindrome (11111222211111).

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