Base | Representation |
---|---|
bin | 11011100010100011101010… |
… | …111110111011001010011001 |
3 | 120212212011002211120100020220 |
4 | 123202203222332323022121 |
5 | 111333430344122023001 |
6 | 1105334404325510253 |
7 | 34340530366601100 |
oct | 3342435276731231 |
9 | 525764084510226 |
10 | 121122020111001 |
11 | 35658618787548 |
12 | 11702313572389 |
13 | 52779b0278a10 |
14 | 21ca4a0c31037 |
15 | e009dd3a8c36 |
hex | 6e28eafbb299 |
121122020111001 has 24 divisors (see below), whose sum is σ = 202313703924864. Its totient is φ = 63888538079520.
The previous prime is 121122020110963. The next prime is 121122020111069. The reversal of 121122020111001 is 100111020221121.
It is a happy number.
It is not a de Polignac number, because 121122020111001 - 27 = 121122020110873 is a prime.
It is a super-2 number, since 2×1211220201110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121122020113001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31690741185 + ... + 31690745006.
It is an arithmetic number, because the mean of its divisors is an integer number (8429737663536).
Almost surely, 2121122020111001 is an apocalyptic number.
It is an amenable number.
121122020111001 is a deficient number, since it is larger than the sum of its proper divisors (81191683813863).
121122020111001 is a wasteful number, since it uses less digits than its factorization.
121122020111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63381486221 (or 63381486214 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 121122020111001 its reverse (100111020221121), we get a palindrome (221233040332122).
The spelling of 121122020111001 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •