13101111023 has 48 divisors (see below), whose sum is σ = 17733701376. Its totient is φ = 9398488320.

The previous prime is 13101111017. The next prime is 13101111041. The reversal of 13101111023 is 32011110131.

It is a happy number.

It is not a de Polignac number, because 13101111023 - 2¹⁰ = 13101109999 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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 47 ways as a sum of consecutive naturals, for example, 5945840 + ... + 5948042.

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

Almost surely, 2^13101111023 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 18, while the sum is 14.

Adding to 13101111023 its reverse (32011110131), we get a palindrome (45112221154).

The spelling of 13101111023 in words is "thirteen billion, one hundred one million, one hundred eleven thousand, twenty-three".