Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …000011010101001001101111 |
3 | 112102211110101002002121211011 |
4 | 121002022220003111021233 |
5 | 103412334310321023043 |
6 | 1030055125153010051 |
7 | 32122314625112653 |
oct | 3102125003251157 |
9 | 472743332077734 |
10 | 110100011111023 |
11 | 32099174a7515a |
12 | 10422152b53927 |
13 | 49585041a136b |
14 | 1d28c24654a63 |
15 | cade498e459d |
hex | 6422a80d526f |
110100011111023 has 2 divisors, whose sum is σ = 110100011111024. Its totient is φ = 110100011111022.
The previous prime is 110100011111009. The next prime is 110100011111029. The reversal of 110100011111023 is 320111110001011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110100011111023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100011110994 and 110100011111012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100011111029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050005555511 + 55050005555512.
It is an arithmetic number, because the mean of its divisors is an integer number (55050005555512).
Almost surely, 2110100011111023 is an apocalyptic number.
110100011111023 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100011111023 is an equidigital number, since it uses as much as digits as its factorization.
110100011111023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 110100011111023 its reverse (320111110001011), we get a palindrome (430211121112034).
The spelling of 110100011111023 in words is "one hundred ten trillion, one hundred billion, eleven million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •