Search a number
-
+
11010111001011 = 321964386614041
BaseRepresentation
bin1010000000110111110111…
…0000010101000110110011
31102222120000120021202012100
42200031331300111012303
52420342201404013021
635225550345231443
72214311546236353
oct240157560250663
942876016252170
1011010111001011
1135653a86996a1
1212999bba92583
1361b3311073a5
142a0c6c350b63
151415e9191626
hexa037dc151b3

11010111001011 has 12 divisors (see below), whose sum is σ = 16740519650920. Its totient is φ = 6953754316320.

The previous prime is 11010111001003. The next prime is 11010111001063. The reversal of 11010111001011 is 11010011101011.

It is not a de Polignac number, because 11010111001011 - 23 = 11010111001003 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11010111000984 and 11010111001002.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32193306850 + ... + 32193307191.

Almost surely, 211010111001011 is an apocalyptic number.

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

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

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

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

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

Adding to 11010111001011 its reverse (11010011101011), we get a palindrome (22020122102022).

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

Divisors: 1 3 9 19 57 171 64386614041 193159842123 579479526369 1223345666779 3670037000337 11010111001011