Base | Representation |
---|---|
bin | 1001100110101101001000… |
… | …10000111111001100101101 |
3 | 2202210011021110221000200020 |
4 | 10303112210100333030231 |
5 | 10232022013142023041 |
6 | 112530523134352353 |
7 | 4306643540520414 |
oct | 463264420771455 |
9 | 82704243830606 |
10 | 21121110111021 |
11 | 680345a038978 |
12 | 24514b505b6b9 |
13 | ba293474785b |
14 | 5303a521c47b |
15 | 26961dc84866 |
hex | 1335a443f32d |
21121110111021 has 16 divisors (see below), whose sum is σ = 28182471168000. Its totient is φ = 14070247733808.
The previous prime is 21121110110999. The next prime is 21121110111047. The reversal of 21121110111021 is 12011101112112.
It is a de Polignac number, because none of the positive numbers 2k-21121110111021 is a prime.
It is a super-2 number, since 2×211211101110212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21121110111061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26486310 + ... + 27272088.
It is an arithmetic number, because the mean of its divisors is an integer number (1761404448000).
Almost surely, 221121110111021 is an apocalyptic number.
It is an amenable number.
21121110111021 is a deficient number, since it is larger than the sum of its proper divisors (7061361056979).
21121110111021 is a wasteful number, since it uses less digits than its factorization.
21121110111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 792448.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 21121110111021 its reverse (12011101112112), we get a palindrome (33132211223133).
The spelling of 21121110111021 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred ten million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •