Search a number
-
+
11000011111011 = 321394017188983
BaseRepresentation
bin1010000000010010001111…
…0000010011101001100011
31102221120221200120011202100
42200010203300103221203
52420211010321023021
635221200233421443
72213503346501046
oct240044360235143
942846850504670
1011000011111011
11356109555886a
121297a6156a883
1361a3b1814510
142a0590c28c5d
15141207651626
hexa0123c13a63

11000011111011 has 12 divisors (see below), whose sum is σ = 17111128395088. Its totient is φ = 6769237606704.

The previous prime is 11000011110997. The next prime is 11000011111031. The reversal of 11000011111011 is 11011111000011.

It is not a de Polignac number, because 11000011111011 - 230 = 10998937369187 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 = 11000011110984 and 11000011111002.

It is not an unprimeable number, because it can be changed into a prime (11000011111031) 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 11 ways as a sum of consecutive naturals, for example, 47008594375 + ... + 47008594608.

Almost surely, 211000011111011 is an apocalyptic number.

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

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

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

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

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

Adding to 11000011111011 its reverse (11011111000011), we get a palindrome (22011122111022).

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

Divisors: 1 3 9 13 39 117 94017188983 282051566949 846154700847 1222223456779 3666670370337 11000011111011