Search a number
BaseRepresentation
bin1010000000010110010010…
…1101111010000110010111
31102221200202122101022220100
42200011210231322012113
52420220223324013421
635221500325505143
72213542352426154
oct240054455720627
942850678338810
1011001101001111
1135615a4798391
1212981065721b3
1361a5265655c0
142a065589522b
1514126d18bc26
hexa0164b7a197

11001101001111 has 96 divisors (see below), whose sum is σ = 17447340298752. Its totient is φ = 6638296654080.

The previous prime is 11001101001091. The next prime is 11001101001119. The reversal of 11001101001111 is 11110010110011.

It is not a de Polignac number, because 11001101001111 - 27 = 11001101000983 is a prime.

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 = 11001101001093 and 11001101001102.

It is a congruent number.

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

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

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

Almost surely, 211001101001111 is an apocalyptic number.

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

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

11001101001111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 11001101001111 its reverse (11110010110011), we get a palindrome (22111111111122).

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