Base | Representation |
---|---|
bin | 1010001101000101110000… |
… | …1111011010000110111001 |
3 | 1110201121210020110100022120 |
4 | 2203101130033122012321 |
5 | 2432312031020320441 |
6 | 35510221532311453 |
7 | 2235422053304334 |
oct | 243213417320671 |
9 | 43647706410276 |
10 | 11220002120121 |
11 | 3636415767aa3 |
12 | 1312618012589 |
13 | 6350706b0b62 |
14 | 2ab09dd3161b |
15 | 146cd0b67966 |
hex | a345c3da1b9 |
11220002120121 has 32 divisors (see below), whose sum is σ = 15911291230848. Its totient is φ = 7008330240000.
The previous prime is 11220002120111. The next prime is 11220002120141. The reversal of 11220002120121 is 12102120002211.
11220002120121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11220002120121 - 27 = 11220002119993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11220002120121.
It is not an unprimeable number, because it can be changed into a prime (11220002120111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58570746 + ... + 58761996.
It is an arithmetic number, because the mean of its divisors is an integer number (497227850964).
Almost surely, 211220002120121 is an apocalyptic number.
It is an amenable number.
11220002120121 is a deficient number, since it is larger than the sum of its proper divisors (4691289110727).
11220002120121 is a wasteful number, since it uses less digits than its factorization.
11220002120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196441.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11220002120121 its reverse (12102120002211), we get a palindrome (23322122122332).
The spelling of 11220002120121 in words is "eleven trillion, two hundred twenty billion, two million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •