Base | Representation |
---|---|
bin | 11001001111011011001010… |
… | …010111111111111000011111 |
3 | 112120001120002211020210201121 |
4 | 121033123022113333320133 |
5 | 104022301233211133043 |
6 | 1032033445434551411 |
7 | 32245201020061135 |
oct | 3117331227777037 |
9 | 476046084223647 |
10 | 111011120021023 |
11 | 3240a60821a502 |
12 | 1054a847598567 |
13 | 49c33c42c7ca1 |
14 | 1d5ad7717b755 |
15 | cc79c2324ded |
hex | 64f6ca5ffe1f |
111011120021023 has 2 divisors, whose sum is σ = 111011120021024. Its totient is φ = 111011120021022.
The previous prime is 111011120021017. The next prime is 111011120021069. The reversal of 111011120021023 is 320120021110111.
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-111011120021023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111011120020988 and 111011120021006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111011120025023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505560010511 + 55505560010512.
It is an arithmetic number, because the mean of its divisors is an integer number (55505560010512).
Almost surely, 2111011120021023 is an apocalyptic number.
111011120021023 is a deficient number, since it is larger than the sum of its proper divisors (1).
111011120021023 is an equidigital number, since it uses as much as digits as its factorization.
111011120021023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 111011120021023 its reverse (320120021110111), we get a palindrome (431131141131134).
The spelling of 111011120021023 in words is "one hundred eleven trillion, eleven billion, one hundred twenty million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •