Base | Representation |
---|---|
bin | 11001000010010011111011… |
… | …011111110001010101001111 |
3 | 112102212102011021212001221112 |
4 | 121002103323133301111033 |
5 | 103413020240224304444 |
6 | 1030103500335122235 |
7 | 32123120320624604 |
oct | 3102237337612517 |
9 | 472772137761845 |
10 | 110110001009999 |
11 | 320a2431010111 |
12 | 1042408067337b |
13 | 4959436a62ca3 |
14 | 1d294d13086ab |
15 | cae33195969e |
hex | 6424fb7f154f |
110110001009999 has 2 divisors, whose sum is σ = 110110001010000. Its totient is φ = 110110001009998.
The previous prime is 110110001009993. The next prime is 110110001010041. The reversal of 110110001009999 is 999900100011011.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (999900100011011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110110001009999 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110110001009993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055000504999 + 55055000505000.
It is an arithmetic number, because the mean of its divisors is an integer number (55055000505000).
Almost surely, 2110110001009999 is an apocalyptic number.
110110001009999 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110001009999 is an equidigital number, since it uses as much as digits as its factorization.
110110001009999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 41.
The spelling of 110110001009999 in words is "one hundred ten trillion, one hundred ten billion, one million, nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •