Base | Representation |
---|---|
bin | 1010001101001101111111… |
… | …0110100100010110111100 |
3 | 1110201211111010100110212121 |
4 | 2203103133312210112330 |
5 | 2432331041302413040 |
6 | 35511225011212324 |
7 | 2235530554551100 |
oct | 243233766442674 |
9 | 43654433313777 |
10 | 11222210201020 |
11 | 3637349106945 |
12 | 1312b335a70a4 |
13 | 635332cb16c0 |
14 | 2ab22d2b3900 |
15 | 146dae92dc4a |
hex | a34dfda45bc |
11222210201020 has 72 divisors (see below), whose sum is σ = 29523045331584. Its totient is φ = 3551644543104.
The previous prime is 11222210201011. The next prime is 11222210201053. The reversal of 11222210201020 is 2010201222211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11222210200985 and 11222210201003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 440419372 + ... + 440444851.
It is an arithmetic number, because the mean of its divisors is an integer number (410042296272).
Almost surely, 211222210201020 is an apocalyptic number.
11222210201020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222210201020 is an abundant number, since it is smaller than the sum of its proper divisors (18300835130564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222210201020 is a wasteful number, since it uses less digits than its factorization.
11222210201020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880864259 (or 880864250 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11222210201020 its reverse (2010201222211), we get a palindrome (13232411423231).
The spelling of 11222210201020 in words is "eleven trillion, two hundred twenty-two billion, two hundred ten million, two hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •