Base | Representation |
---|---|
bin | 1010001100100001010010… |
… | …1001101011000001101110 |
3 | 1110200200111212221112210221 |
4 | 2203020110221223001232 |
5 | 2432132003021023042 |
6 | 35501522213121554 |
7 | 2234624324144320 |
oct | 243102451530156 |
9 | 43620455845727 |
10 | 11210211111022 |
11 | 3632250a16a40 |
12 | 13107450292ba |
13 | 6341700a8151 |
14 | 2aa811851610 |
15 | 14690b2dcd67 |
hex | a3214a6b06e |
11210211111022 has 32 divisors (see below), whose sum is σ = 20977548355584. Its totient is φ = 4364906863200.
The previous prime is 11210211110999. The next prime is 11210211111023. The reversal of 11210211111022 is 22011111201211.
It is a super-2 number, since 2×112102111110222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11210211110987 and 11210211111005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210211111023) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 22316254 + ... + 22813057.
It is an arithmetic number, because the mean of its divisors is an integer number (655548386112).
Almost surely, 211210211111022 is an apocalyptic number.
11210211111022 is a deficient number, since it is larger than the sum of its proper divisors (9767337244562).
11210211111022 is a wasteful number, since it uses less digits than its factorization.
11210211111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45130944.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11210211111022 its reverse (22011111201211), we get a palindrome (33221322312233).
The spelling of 11210211111022 in words is "eleven trillion, two hundred ten billion, two hundred eleven million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •