Base | Representation |
---|---|
bin | 11001000011111010011110… |
… | …000001101101110110001011 |
3 | 112110020221100102021212120102 |
4 | 121003322132001231312023 |
5 | 103421321232103000021 |
6 | 1030230225453320015 |
7 | 32134065606612563 |
oct | 3103723601556613 |
9 | 473227312255512 |
10 | 110220102000011 |
11 | 321350a0168543 |
12 | 1044148919600b |
13 | 496693215c1a3 |
14 | 1d30977a99da3 |
15 | cb212785000b |
hex | 643e9e06dd8b |
110220102000011 has 2 divisors, whose sum is σ = 110220102000012. Its totient is φ = 110220102000010.
The previous prime is 110220101999993. The next prime is 110220102000023. The reversal of 110220102000011 is 110000201022011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110220102000011 - 214 = 110220101983627 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110220101999956 and 110220102000001.
It is not a weakly prime, because it can be changed into another prime (110220102000511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110051000005 + 55110051000006.
It is an arithmetic number, because the mean of its divisors is an integer number (55110051000006).
Almost surely, 2110220102000011 is an apocalyptic number.
110220102000011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220102000011 is an equidigital number, since it uses as much as digits as its factorization.
110220102000011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110220102000011 its reverse (110000201022011), we get a palindrome (220220303022022).
The spelling of 110220102000011 in words is "one hundred ten trillion, two hundred twenty billion, one hundred two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •