Base | Representation |
---|---|
bin | 11001000000110111101110… |
… | …100100111001000111110011 |
3 | 112102111221121201222201201221 |
4 | 121000313232210321013303 |
5 | 103404410012000013021 |
6 | 1025550204500005511 |
7 | 32113014064135414 |
oct | 3100675644710763 |
9 | 472457551881657 |
10 | 110011000001011 |
11 | 3206444857981a |
12 | 10408a51390897 |
13 | 494ccba1c93b5 |
14 | 1d247bcc1180b |
15 | cab98a2a2241 |
hex | 640dee9391f3 |
110011000001011 has 2 divisors, whose sum is σ = 110011000001012. Its totient is φ = 110011000001010.
The previous prime is 110011000000997. The next prime is 110011000001113. The reversal of 110011000001011 is 110100000110011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110011000001011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011000000985 and 110011000001003.
It is not a weakly prime, because it can be changed into another prime (110011000001411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005500000505 + 55005500000506.
It is an arithmetic number, because the mean of its divisors is an integer number (55005500000506).
Almost surely, 2110011000001011 is an apocalyptic number.
110011000001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011000001011 is an equidigital number, since it uses as much as digits as its factorization.
110011000001011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110011000001011 its reverse (110100000110011), we get a palindrome (220111000111022).
The spelling of 110011000001011 in words is "one hundred ten trillion, eleven billion, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •