10913641111 has 4 divisors (see below), whose sum is σ = 10916339224. Its totient is φ = 10910943000.

The previous prime is 10913641103. The next prime is 10913641117. The reversal of 10913641111 is 11114631901.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11114631901 = 29 ⋅383263169.

It is a cyclic number.

It is not a de Polignac number, because 10913641111 - 2³ = 10913641103 is a prime.

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 10913641111.

It is a congruent number.

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

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

Almost surely, 2^10913641111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2698112.

The product of its (nonzero) digits is 648, while the sum is 28.

The spelling of 10913641111 in words is "ten billion, nine hundred thirteen million, six hundred forty-one thousand, one hundred eleven".