Base | Representation |
---|---|
bin | 1001101001100111011010… |
… | …10100011110101101110010 |
3 | 2210010201102100012100022100 |
4 | 10310303231110132231302 |
5 | 10240141323210323442 |
6 | 113044503053521230 |
7 | 4320114064611243 |
oct | 464635524365562 |
9 | 83121370170270 |
10 | 21221120011122 |
11 | 6841910016079 |
12 | 24689661a3216 |
13 | bac1b2312535 |
14 | 5351716d8cca |
15 | 26c023cc784c |
hex | 134ced51eb72 |
21221120011122 has 48 divisors (see below), whose sum is σ = 46978925984640. Its totient is φ = 6920024433696.
The previous prime is 21221120011067. The next prime is 21221120011127. The reversal of 21221120011122 is 22111002112212.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21221120011095 and 21221120011104.
It is not an unprimeable number, because it can be changed into a prime (21221120011127) 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, 3912433 + ... + 7599300.
It is an arithmetic number, because the mean of its divisors is an integer number (978727624680).
Almost surely, 221221120011122 is an apocalyptic number.
21221120011122 is an abundant number, since it is smaller than the sum of its proper divisors (25757805973518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21221120011122 is a wasteful number, since it uses less digits than its factorization.
21221120011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11513967 (or 11513964 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21221120011122 its reverse (22111002112212), we get a palindrome (43332122123334).
The spelling of 21221120011122 in words is "twenty-one trillion, two hundred twenty-one billion, one hundred twenty million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •