Search a number
-
+
11001111210111 = 311379009919091
BaseRepresentation
bin1010000000010110010101…
…0100110110100001111111
31102221200210100121000000110
42200011211110312201333
52420220233432210421
635221501332401103
72213542535256051
oct240054524664177
942850710530013
1011001111210111
1135615aa530580
121298109a76193
1361a5286cb329
142a0656d918d1
1514126e006a76
hexa016553687f

11001111210111 has 16 divisors (see below), whose sum is σ = 16434092423808. Its totient is φ = 6487141744800.

The previous prime is 11001111210107. The next prime is 11001111210119. The reversal of 11001111210111 is 11101211110011.

It is not a de Polignac number, because 11001111210111 - 22 = 11001111210107 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211001111210111 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9009919142.

The product of its (nonzero) digits is 2, while the sum is 12.

Adding to 11001111210111 its reverse (11101211110011), we get a palindrome (22102322320122).

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

Divisors: 1 3 11 33 37 111 407 1221 9009919091 27029757273 99109110001 297327330003 333367006367 1000101019101 3667037070037 11001111210111