Search a number
11010111010011 = 325212348072299
BaseRepresentation
bin1010000000110111110111…
…0000010111010011011011
31102222120000120022012112200
42200031331300113103123
52420342201404310021
635225550345341243
72214311546304531
oct240157560272333
942876016265480
1011010111010011
1135653a86a5433
1212999bba97823
1361b33110b509
142a0c6c354151
151415e9194126
hexa037dc174db

11010111010011 has 12 divisors (see below), whose sum is σ = 15934018627800. Its totient is φ = 7325985569760.

The previous prime is 11010111010009. The next prime is 11010111010049. The reversal of 11010111010011 is 11001011101011.

It is not a de Polignac number, because 11010111010011 - 21 = 11010111010009 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 = 11010111009975 and 11010111010002.

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

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

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

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

Almost surely, 211010111010011 is an apocalyptic number.

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

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

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

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

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

Adding to 11010111010011 its reverse (11001011101011), we get a palindrome (22011122111022).

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