Base | Representation |
---|---|
bin | 1001100110011000011101… |
… | …10001001000100100011110 |
3 | 2202202002122000220122020220 |
4 | 10303030032301020210132 |
5 | 10231331301034133042 |
6 | 112521450004022210 |
7 | 4306101530356041 |
oct | 463141661104436 |
9 | 82662560818226 |
10 | 21110012021022 |
11 | 67a97844a3671 |
12 | 244b318391966 |
13 | ba18863c7bb2 |
14 | 52da312d6c58 |
15 | 2691be7bb8ec |
hex | 13330ec4891e |
21110012021022 has 8 divisors (see below), whose sum is σ = 42220024042056. Its totient is φ = 7036670673672.
The previous prime is 21110012020969. The next prime is 21110012021027. The reversal of 21110012021022 is 22012021001112.
It is a sphenic number, since it is the product of 3 distinct primes.
21110012021022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 21110012020992 and 21110012021010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110012021027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1759167668413 + ... + 1759167668424.
It is an arithmetic number, because the mean of its divisors is an integer number (5277503005257).
Almost surely, 221110012021022 is an apocalyptic number.
21110012021022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110012021022 is a wasteful number, since it uses less digits than its factorization.
21110012021022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3518335336842.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21110012021022 its reverse (22012021001112), we get a palindrome (43122033022134).
The spelling of 21110012021022 in words is "twenty-one trillion, one hundred ten billion, twelve million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •