Base | Representation |
---|---|
bin | 1001100110001001101111… |
… | …10101111110010100011110 |
3 | 2202201100020102011102011200 |
4 | 10303010313311332110132 |
5 | 10231214110433033042 |
6 | 112514102010300330 |
7 | 4305401662566516 |
oct | 463046765762436 |
9 | 82640212142150 |
10 | 21102111221022 |
11 | 67a639a720697 |
12 | 24498924276a6 |
13 | ba0bc75a8400 |
14 | 52d4c1c92846 |
15 | 268daad68c4c |
hex | 133137d7e51e |
21102111221022 has 72 divisors (see below), whose sum is σ = 49514329215000. Its totient is φ = 6492232079424.
The previous prime is 21102111220999. The next prime is 21102111221089. The reversal of 21102111221022 is 22012211120112.
21102111221022 is a `hidden beast` number, since 211 + 0 + 211 + 1 + 221 + 0 + 22 = 666.
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 = 21102111220986 and 21102111221004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 27174604 + ... + 27940352.
It is an arithmetic number, because the mean of its divisors is an integer number (687699016875).
Almost surely, 221102111221022 is an apocalyptic number.
21102111221022 is an abundant number, since it is smaller than the sum of its proper divisors (28412217993978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21102111221022 is a wasteful number, since it uses less digits than its factorization.
21102111221022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 774842 (or 774826 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21102111221022 its reverse (22012211120112), we get a palindrome (43114322341134).
The spelling of 21102111221022 in words is "twenty-one trillion, one hundred two billion, one hundred eleven million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •