Base | Representation |
---|---|
bin | 11001000011110010000000… |
… | …001110001000000100111111 |
3 | 112110020001212220212010122112 |
4 | 121003302000032020010333 |
5 | 103421144123033031421 |
6 | 1030222123455204235 |
7 | 32133324422115146 |
oct | 3103620016100477 |
9 | 473201786763575 |
10 | 110211012002111 |
11 | 32131256097589 |
12 | 1043b770b1667b |
13 | 4965b13b5abc7 |
14 | 1d3035473875d |
15 | cb1c947e745b |
hex | 643c8038813f |
110211012002111 has 2 divisors, whose sum is σ = 110211012002112. Its totient is φ = 110211012002110.
The previous prime is 110211012002099. The next prime is 110211012002141. The reversal of 110211012002111 is 111200210112011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110211012002111 - 214 = 110211011985727 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110211012002141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105506001055 + 55105506001056.
It is an arithmetic number, because the mean of its divisors is an integer number (55105506001056).
Almost surely, 2110211012002111 is an apocalyptic number.
110211012002111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211012002111 is an equidigital number, since it uses as much as digits as its factorization.
110211012002111 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 14.
Adding to 110211012002111 its reverse (111200210112011), we get a palindrome (221411222114122).
The spelling of 110211012002111 in words is "one hundred ten trillion, two hundred eleven billion, twelve million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •