Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1110001101100100100101 |
3 | 1102222122100101002110220122 |
4 | 2200032303132031210211 |
5 | 2420401023112034341 |
6 | 35230220021411325 |
7 | 2214343101416465 |
oct | 240166336154445 |
9 | 42878311073818 |
10 | 11011012221221 |
11 | 3565820384791 |
12 | 129a011869b45 |
13 | 61b445a3a29c |
14 | 2a0d15d07ba5 |
15 | 14164d35e94b |
hex | a03b378d925 |
11011012221221 has 2 divisors, whose sum is σ = 11011012221222. Its totient is φ = 11011012221220.
The previous prime is 11011012221163. The next prime is 11011012221227. The reversal of 11011012221221 is 12212221011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9933931490596 + 1077080730625 = 3151814^2 + 1037825^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011012221221 - 234 = 10993832352037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011012221221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011012221227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505506110610 + 5505506110611.
It is an arithmetic number, because the mean of its divisors is an integer number (5505506110611).
Almost surely, 211011012221221 is an apocalyptic number.
It is an amenable number.
11011012221221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011012221221 is an equidigital number, since it uses as much as digits as its factorization.
11011012221221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11011012221221 its reverse (12212221011011), we get a palindrome (23223233232232).
The spelling of 11011012221221 in words is "eleven trillion, eleven billion, twelve million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •