Base | Representation |
---|---|
bin | 10011101010010100… |
… | …011101011001011110 |
3 | 2000111021021001022110 |
4 | 103222110131121132 |
5 | 321213420213042 |
6 | 13410500054450 |
7 | 1345103253324 |
oct | 235224353136 |
9 | 60437231273 |
10 | 21111101022 |
11 | 8a53736730 |
12 | 4112094426 |
13 | 1cb594436b |
14 | 1043ab3d14 |
15 | 83859609c |
hex | 4ea51d65e |
21111101022 has 16 divisors (see below), whose sum is σ = 46060584192. Its totient is φ = 6397303320.
The previous prime is 21111101017. The next prime is 21111101051. The reversal of 21111101022 is 22010111112.
It is a super-3 number, since 3×211111010223 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 21111100989 and 21111101007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159932518 + ... + 159932649.
It is an arithmetic number, because the mean of its divisors is an integer number (2878786512).
Almost surely, 221111101022 is an apocalyptic number.
21111101022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21111101022 is an abundant number, since it is smaller than the sum of its proper divisors (24949483170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21111101022 is a wasteful number, since it uses less digits than its factorization.
21111101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319865183.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21111101022 its reverse (22010111112), we get a palindrome (43121212134).
The spelling of 21111101022 in words is "twenty-one billion, one hundred eleven million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •