Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …00110010111001000011 |
3 | 10120122211022020001010202 |
4 | 32231222100302321003 |
5 | 113031213111232321 |
6 | 2052254252115415 |
7 | 133023001031033 |
oct | 16555220627103 |
9 | 3518738201122 |
10 | 1011100102211 |
11 | 35a894714a91 |
12 | 143b5b465b6b |
13 | 74466b71364 |
14 | 36d1a7338c3 |
15 | 1b47aeca70b |
hex | eb6a432e43 |
1011100102211 has 2 divisors, whose sum is σ = 1011100102212. Its totient is φ = 1011100102210.
The previous prime is 1011100102147. The next prime is 1011100102219. The reversal of 1011100102211 is 1122010011101.
1011100102211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1011100102211 - 26 = 1011100102147 is a prime.
It is a super-3 number, since 3×10111001022113 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011100102192 and 1011100102201.
It is not a weakly prime, because it can be changed into another prime (1011100102219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505550051105 + 505550051106.
It is an arithmetic number, because the mean of its divisors is an integer number (505550051106).
Almost surely, 21011100102211 is an apocalyptic number.
1011100102211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011100102211 is an equidigital number, since it uses as much as digits as its factorization.
1011100102211 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 11.
Adding to 1011100102211 its reverse (1122010011101), we get a palindrome (2133110113312).
The spelling of 1011100102211 in words is "one trillion, eleven billion, one hundred million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •