Base | Representation |
---|---|
bin | 11001000010001010101110… |
… | …100010101101110111011011 |
3 | 112102211110122122222212011201 |
4 | 121002022232202231313123 |
5 | 103412340021210031021 |
6 | 1030055144042535031 |
7 | 32122320416505256 |
oct | 3102125642556733 |
9 | 472743578885151 |
10 | 110100120002011 |
11 | 32099220489607 |
12 | 10422183507477 |
13 | 49585209089b9 |
14 | 1d28c34cbc09d |
15 | cade54253591 |
hex | 6422ae8adddb |
110100120002011 has 2 divisors, whose sum is σ = 110100120002012. Its totient is φ = 110100120002010.
The previous prime is 110100120001969. The next prime is 110100120002021. The reversal of 110100120002011 is 110200021001011.
It is an a-pointer prime, because the next prime (110100120002021) can be obtained adding 110100120002011 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110100120002011 - 211 = 110100119999963 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100120002021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050060001005 + 55050060001006.
It is an arithmetic number, because the mean of its divisors is an integer number (55050060001006).
Almost surely, 2110100120002011 is an apocalyptic number.
110100120002011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100120002011 is an equidigital number, since it uses as much as digits as its factorization.
110100120002011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110100120002011 its reverse (110200021001011), we get a palindrome (220300141003022).
The spelling of 110100120002011 in words is "one hundred ten trillion, one hundred billion, one hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •