Base | Representation |
---|---|
bin | 1010001011111111110000… |
… | …1101011100000101100110 |
3 | 1110122211021122212201220000 |
4 | 2202333330031130011212 |
5 | 2432010040021401042 |
6 | 35453433152122130 |
7 | 2234155311410325 |
oct | 242777415340546 |
9 | 43584248781800 |
10 | 11201211122022 |
11 | 3629452732aa9 |
12 | 130aa52b36346 |
13 | 63336762cb7c |
14 | 2aa1da4400bc |
15 | 14658111474c |
hex | a2ffc35c166 |
11201211122022 has 40 divisors (see below), whose sum is σ = 25099289787000. Its totient is φ = 3733695435456.
The previous prime is 11201211122009. The next prime is 11201211122033. The reversal of 11201211122022 is 22022111210211.
11201211122022 is a `hidden beast` number, since 11 + 201 + 211 + 1 + 220 + 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 = 11201211121986 and 11201211122004.
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, 16465854 + ... + 17132622.
It is an arithmetic number, because the mean of its divisors is an integer number (627482244675).
Almost surely, 211201211122022 is an apocalyptic number.
11201211122022 is an abundant number, since it is smaller than the sum of its proper divisors (13898078664978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201211122022 is a wasteful number, since it uses less digits than its factorization.
11201211122022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 770482 (or 770473 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11201211122022 its reverse (22022111210211), we get a palindrome (33223322332233).
The spelling of 11201211122022 in words is "eleven trillion, two hundred one billion, two hundred eleven million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •