11009366391 has 16 divisors (see below), whose sum is σ = 15120676064. Its totient is φ = 7119995904.

The previous prime is 11009366387. The next prime is 11009366399. The reversal of 11009366391 is 19366390011.

11009366391 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11009366391 - 2² = 11009366387 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109750 + ... + 184563.

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

Almost surely, 2^11009366391 is an apocalyptic number.

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

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

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

The sum of its prime factors is 294690.

The product of its (nonzero) digits is 26244, while the sum is 39.

The spelling of 11009366391 in words is "eleven billion, nine million, three hundred sixty-six thousand, three hundred ninety-one".