Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …011010001110101101001011 |
3 | 112102211110121100020110022221 |
4 | 121002022231122032231023 |
5 | 103412340001324000021 |
6 | 1030055142123354511 |
7 | 32122320066133663 |
oct | 3102125532165513 |
9 | 472743540213287 |
10 | 110100101000011 |
11 | 32099210790081 |
12 | 10422179082a37 |
13 | 49585199b4905 |
14 | 1d28c325731a3 |
15 | cade5274d241 |
hex | 6422ad68eb4b |
110100101000011 has 2 divisors, whose sum is σ = 110100101000012. Its totient is φ = 110100101000010.
The previous prime is 110100100999981. The next prime is 110100101000017. The reversal of 110100101000011 is 110000101001011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110100101000011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100100999958 and 110100101000003.
It is not a weakly prime, because it can be changed into another prime (110100101000017) 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, 55050050500005 + 55050050500006.
It is an arithmetic number, because the mean of its divisors is an integer number (55050050500006).
Almost surely, 2110100101000011 is an apocalyptic number.
110100101000011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100101000011 is an equidigital number, since it uses as much as digits as its factorization.
110100101000011 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 110100101000011 its reverse (110000101001011), we get a palindrome (220100202001022).
The spelling of 110100101000011 in words is "one hundred ten trillion, one hundred billion, one hundred one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •