Base | Representation |
---|---|
bin | 1001001100001101111101… |
… | …01111011000110010011110 |
3 | 2122120011011211010020011100 |
4 | 10212012332233120302132 |
5 | 10122114132413033042 |
6 | 110552452011133530 |
7 | 4154124642554412 |
oct | 446067657306236 |
9 | 78504154106140 |
10 | 20211021221022 |
11 | 649249a640765 |
12 | 23250461442a6 |
13 | b37b77a4a668 |
14 | 4dc30bd74d42 |
15 | 250b05b8c24c |
hex | 1261bebd8c9e |
20211021221022 has 48 divisors (see below), whose sum is σ = 43811023246848. Its totient is φ = 6733857330960.
The previous prime is 20211021221021. The next prime is 20211021221051. The reversal of 20211021221022 is 22012212011202.
It is a happy number.
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 = 20211021220986 and 20211021221004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20211021221021) 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, 542952703 + ... + 542989925.
It is an arithmetic number, because the mean of its divisors is an integer number (912729650976).
Almost surely, 220211021221022 is an apocalyptic number.
20211021221022 is an abundant number, since it is smaller than the sum of its proper divisors (23600002025826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20211021221022 is a wasteful number, since it uses less digits than its factorization.
20211021221022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50525 (or 50522 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 20211021221022 its reverse (22012212011202), we get a palindrome (42223233232224).
The spelling of 20211021221022 in words is "twenty trillion, two hundred eleven billion, twenty-one million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •