Base | Representation |
---|---|
bin | 110000000001011001011001… |
… | …010011100000110110011110 |
3 | 1000200210201211212002020110000 |
4 | 300001121121103200312132 |
5 | 210140314121321213042 |
6 | 2025104543243355130 |
7 | 62325566621143653 |
oct | 6001313123406636 |
9 | 1020721755066400 |
10 | 211202220101022 |
11 | 613283a4242197 |
12 | 1b8304a4222aa6 |
13 | 90b038c950b37 |
14 | 3a2235606bc2a |
15 | 1963cc3a5a74c |
hex | c016594e0d9e |
211202220101022 has 40 divisors (see below), whose sum is σ = 474271556258016. Its totient is φ = 70248686574528.
The previous prime is 211202220101017. The next prime is 211202220101053. The reversal of 211202220101022 is 220101022202112.
It is a happy number.
211202220101022 is a `hidden beast` number, since 211 + 202 + 220 + 1 + 0 + 10 + 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 = 211202220100986 and 211202220101004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1407827163 + ... + 1407977174.
Almost surely, 2211202220101022 is an apocalyptic number.
211202220101022 is an abundant number, since it is smaller than the sum of its proper divisors (263069336156994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211202220101022 is a wasteful number, since it uses less digits than its factorization.
211202220101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2815804814 (or 2815804805 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 211202220101022 its reverse (220101022202112), we get a palindrome (431303242303134).
The spelling of 211202220101022 in words is "two hundred eleven trillion, two hundred two billion, two hundred twenty million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •