Base | Representation |
---|---|
bin | 101101101110100100010110… |
… | …011100000110010110110110 |
3 | 222101002010210101222020010021 |
4 | 231232210112130012112312 |
5 | 202330010311321200042 |
6 | 1551421402314115354 |
7 | 60234610203220030 |
oct | 5556442634062666 |
9 | 871063711866107 |
10 | 201112220100022 |
11 | 59098239297360 |
12 | 1a680a8b71bb5a |
13 | 882aa549a2a6a |
14 | 3793c52040c50 |
15 | 183b5cc78a867 |
hex | b6e9167065b6 |
201112220100022 has 128 divisors (see below), whose sum is σ = 387656995184640. Its totient is φ = 75988481184000.
The previous prime is 201112220099981. The next prime is 201112220100037. The reversal of 201112220100022 is 220001022211102.
It is a happy number.
It is a super-2 number, since 2×2011122201000222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201112220099969 and 201112220100005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 506012754 + ... + 506410042.
It is an arithmetic number, because the mean of its divisors is an integer number (3028570274880).
Almost surely, 2201112220100022 is an apocalyptic number.
201112220100022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201112220100022 is a deficient number, since it is larger than the sum of its proper divisors (186544775084618).
201112220100022 is a wasteful number, since it uses less digits than its factorization.
201112220100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398138.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201112220100022 its reverse (220001022211102), we get a palindrome (421113242311124).
The spelling of 201112220100022 in words is "two hundred one trillion, one hundred twelve billion, two hundred twenty million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •