Base | Representation |
---|---|
bin | 1010000110001010100001… |
… | …1111000100101111001111 |
3 | 1110022020200022202201110122 |
4 | 2201202220133010233033 |
5 | 2423334343141223043 |
6 | 35335423400055155 |
7 | 2224010451621023 |
oct | 241425037045717 |
9 | 43266608681418 |
10 | 11101022211023 |
11 | 359aa0a6a9308 |
12 | 12b3551a644bb |
13 | 626a8b949594 |
14 | 2a5414286383 |
15 | 143b6a511368 |
hex | a18a87c4bcf |
11101022211023 has 2 divisors, whose sum is σ = 11101022211024. Its totient is φ = 11101022211022.
The previous prime is 11101022210981. The next prime is 11101022211031. The reversal of 11101022211023 is 32011222010111.
It is a happy number.
11101022211023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11101022211023 - 218 = 11101021948879 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101022210992 and 11101022211010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101022210023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550511105511 + 5550511105512.
It is an arithmetic number, because the mean of its divisors is an integer number (5550511105512).
Almost surely, 211101022211023 is an apocalyptic number.
11101022211023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101022211023 is an equidigital number, since it uses as much as digits as its factorization.
11101022211023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11101022211023 its reverse (32011222010111), we get a palindrome (43112244221134).
The spelling of 11101022211023 in words is "eleven trillion, one hundred one billion, twenty-two million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •