10105500101111 has 4 divisors (see below), whose sum is σ = 10120834699800. Its totient is φ = 10090165502424.

The previous prime is 10105500101107. The next prime is 10105500101117. The reversal of 10105500101111 is 11110100550101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10105500101111 - 2² = 10105500101107 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10105500101111.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7667298356 + ... + 7667299673.

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

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

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

10105500101111 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 15334598688.

The product of its (nonzero) digits is 25, while the sum is 17.

Adding to 10105500101111 its reverse (11110100550101), we get a palindrome (21215600651212).

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