Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0001101001110001100111 |
3 | 1102222120021121100121000011 |
4 | 2200032003301221301213 |
5 | 2420342403233323421 |
6 | 35230004354231051 |
7 | 2214314213636425 |
oct | 240160361516147 |
9 | 42876247317004 |
10 | 11010212011111 |
11 | 356544a710015 |
12 | 1299a29885487 |
13 | 61b349012891 |
14 | 2a0c7b926115 |
15 | 141602e954e1 |
hex | a0383c69c67 |
11010212011111 has 2 divisors, whose sum is σ = 11010212011112. Its totient is φ = 11010212011110.
The previous prime is 11010212011069. The next prime is 11010212011133. The reversal of 11010212011111 is 11111021201011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11010212011111 - 27 = 11010212010983 is a prime.
It is a super-2 number, since 2×110102120111112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11010212011091 and 11010212011100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010212011171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505106005555 + 5505106005556.
It is an arithmetic number, because the mean of its divisors is an integer number (5505106005556).
Almost surely, 211010212011111 is an apocalyptic number.
11010212011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010212011111 is an equidigital number, since it uses as much as digits as its factorization.
11010212011111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11010212011111 its reverse (11111021201011), we get a palindrome (22121233212122).
The spelling of 11010212011111 in words is "eleven trillion, ten billion, two hundred twelve million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •