Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0001101000110001100111 |
3 | 1110101002020021012020022222 |
4 | 2201310200301220301213 |
5 | 2424143202333243302 |
6 | 35352320355542555 |
7 | 2225260265135222 |
oct | 241644061506147 |
9 | 43332207166288 |
10 | 11120220212327 |
11 | 35a8071451896 |
12 | 12b720b2baa5b |
13 | 62882b121675 |
14 | 2a6315c425b9 |
15 | 1443e0b5cda2 |
hex | a1d20c68c67 |
11120220212327 has 2 divisors, whose sum is σ = 11120220212328. Its totient is φ = 11120220212326.
The previous prime is 11120220212317. The next prime is 11120220212357. The reversal of 11120220212327 is 72321202202111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11120220212327 - 26 = 11120220212263 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11120220212296 and 11120220212305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120220212317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560110106163 + 5560110106164.
It is an arithmetic number, because the mean of its divisors is an integer number (5560110106164).
Almost surely, 211120220212327 is an apocalyptic number.
11120220212327 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120220212327 is an equidigital number, since it uses as much as digits as its factorization.
11120220212327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
Adding to 11120220212327 its reverse (72321202202111), we get a palindrome (83441422414438).
The spelling of 11120220212327 in words is "eleven trillion, one hundred twenty billion, two hundred twenty million, two hundred twelve thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •