Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001111110100011001001011 |
3 | 112102211200001110211112021112 |
4 | 121002030223033310121023 |
5 | 103412403312310400021 |
6 | 1030100131422000535 |
7 | 32122423313056013 |
oct | 3102145317643113 |
9 | 472750043745245 |
10 | 110102212200011 |
11 | 3209a0a4478969 |
12 | 1042266811614b |
13 | 49587951c4595 |
14 | 1d28d92ad6c43 |
15 | cae027c78d5b |
hex | 64232b3f464b |
110102212200011 has 2 divisors, whose sum is σ = 110102212200012. Its totient is φ = 110102212200010.
The previous prime is 110102212199989. The next prime is 110102212200049. The reversal of 110102212200011 is 110002212201011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110102212200011 - 218 = 110102211937867 is a prime.
It is not a weakly prime, because it can be changed into another prime (110102212200061) 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 as a sum of consecutive naturals, namely, 55051106100005 + 55051106100006.
It is an arithmetic number, because the mean of its divisors is an integer number (55051106100006).
Almost surely, 2110102212200011 is an apocalyptic number.
110102212200011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102212200011 is an equidigital number, since it uses as much as digits as its factorization.
110102212200011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110102212200011 its reverse (110002212201011), we get a palindrome (220104424401022).
The spelling of 110102212200011 in words is "one hundred ten trillion, one hundred two billion, two hundred twelve million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •