Base | Representation |
---|---|
bin | 11101011011001001010… |
… | …000001101101111010000 |
3 | 21011022011102121120221011 |
4 | 131123021100031233100 |
5 | 231112034320200422 |
6 | 4144522111140304 |
7 | 266041214524423 |
oct | 35331120155720 |
9 | 7138142546834 |
10 | 2022011100112 |
11 | 70a591609113 |
12 | 287a67514694 |
13 | 1188a07a1873 |
14 | 6dc19cbd9ba |
15 | 378e55a0077 |
hex | 1d6c940dbd0 |
2022011100112 has 20 divisors (see below), whose sum is σ = 4123838428480. Its totient is φ = 957794731488.
The previous prime is 2022011100041. The next prime is 2022011100119. The reversal of 2022011100112 is 2110011102202.
It is a super-2 number, since 2×20220111001122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2022011100092 and 2022011100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022011100119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3325675848 + ... + 3325676455.
It is an arithmetic number, because the mean of its divisors is an integer number (206191921424).
Almost surely, 22022011100112 is an apocalyptic number.
It is an amenable number.
2022011100112 is an abundant number, since it is smaller than the sum of its proper divisors (2101827328368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022011100112 is a wasteful number, since it uses less digits than its factorization.
2022011100112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6651352330 (or 6651352324 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2022011100112 its reverse (2110011102202), we get a palindrome (4132022202314).
The spelling of 2022011100112 in words is "two trillion, twenty-two billion, eleven million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •