Base | Representation |
---|---|
bin | 1001100110101110110100… |
… | …00001011101011010001001 |
3 | 2202210020121100000020122121 |
4 | 10303113122001131122021 |
5 | 10232030340033310441 |
6 | 112531152433251241 |
7 | 4310005101526021 |
oct | 463273201353211 |
9 | 82706540006577 |
10 | 21122012010121 |
11 | 6803882148030 |
12 | 2451707103b21 |
13 | ba2a49557769 |
14 | 53044cd10a81 |
15 | 269673038dd1 |
hex | 1335da05d689 |
21122012010121 has 32 divisors (see below), whose sum is σ = 24642685458432. Its totient is φ = 17891012348160.
The previous prime is 21122012010097. The next prime is 21122012010137. The reversal of 21122012010121 is 12101021022112.
It is not a de Polignac number, because 21122012010121 - 217 = 21122011879049 is a prime.
It is a super-2 number, since 2×211220120101212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21122012010095 and 21122012010104.
It is not an unprimeable number, because it can be changed into a prime (21122012017121) 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, 28588260 + ... + 29317786.
It is an arithmetic number, because the mean of its divisors is an integer number (770083920576).
Almost surely, 221122012010121 is an apocalyptic number.
It is an amenable number.
21122012010121 is a deficient number, since it is larger than the sum of its proper divisors (3520673448311).
21122012010121 is a wasteful number, since it uses less digits than its factorization.
21122012010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 731109.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21122012010121 its reverse (12101021022112), we get a palindrome (33223033032233).
The spelling of 21122012010121 in words is "twenty-one trillion, one hundred twenty-two billion, twelve million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •