Base | Representation |
---|---|
bin | 1010000111010101000001… |
… | …1101011011011011000001 |
3 | 1110101011022000112220002022 |
4 | 2201311100131123123001 |
5 | 2424201322134033441 |
6 | 35352532014531225 |
7 | 2225316151116326 |
oct | 241652035333301 |
9 | 43334260486068 |
10 | 11121020221121 |
11 | 35a8441a99288 |
12 | 12b73b3206b15 |
13 | 628927aa8555 |
14 | 2a63901b0b4d |
15 | 14443aed784b |
hex | a1d5075b6c1 |
11121020221121 has 2 divisors, whose sum is σ = 11121020221122. Its totient is φ = 11121020221120.
The previous prime is 11121020221099. The next prime is 11121020221147. The reversal of 11121020221121 is 12112202012111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11019744160000 + 101276061121 = 3319600^2 + 318239^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121020221121 - 230 = 11119946479297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11121020221121.
It is not a weakly prime, because it can be changed into another prime (11121020221321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560510110560 + 5560510110561.
It is an arithmetic number, because the mean of its divisors is an integer number (5560510110561).
Almost surely, 211121020221121 is an apocalyptic number.
It is an amenable number.
11121020221121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121020221121 is an equidigital number, since it uses as much as digits as its factorization.
11121020221121 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 11121020221121 its reverse (12112202012111), we get a palindrome (23233222233232).
The spelling of 11121020221121 in words is "eleven trillion, one hundred twenty-one billion, twenty million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •