Base | Representation |
---|---|
bin | 10011110000111000… |
… | …001001101111110100 |
3 | 2000202221021122100220 |
4 | 103300320021233310 |
5 | 321430101333022 |
6 | 13425430134340 |
7 | 1350610360320 |
oct | 236070115764 |
9 | 60687248326 |
10 | 21221121012 |
11 | 8aaa851343 |
12 | 4142ab13b0 |
13 | 2002685850 |
14 | 1054552980 |
15 | 84307985c |
hex | 4f0e09bf4 |
21221121012 has 192 divisors, whose sum is σ = 64677441024. Its totient is φ = 5255331840.
The previous prime is 21221120989. The next prime is 21221121013. The reversal of 21221121012 is 21012112212.
It is a junction number, because it is equal to n+sod(n) for n = 21221120982 and 21221121000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221121013) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10042068 + ... + 10044180.
It is an arithmetic number, because the mean of its divisors is an integer number (336861672).
Almost surely, 221221121012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21221121012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32338720512).
21221121012 is an abundant number, since it is smaller than the sum of its proper divisors (43456320012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21221121012 is a wasteful number, since it uses less digits than its factorization.
21221121012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2698 (or 2696 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21221121012 its reverse (21012112212), we get a palindrome (42233233224).
The spelling of 21221121012 in words is "twenty-one billion, two hundred twenty-one million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •