Base | Representation |
---|---|
bin | 11101011011001000100… |
… | …110010011001001010100 |
3 | 21011022010122221100100220 |
4 | 131123020212103021110 |
5 | 231112024012042322 |
6 | 4144521035434340 |
7 | 266041022241633 |
oct | 35331046231124 |
9 | 7138118840326 |
10 | 2022000112212 |
11 | 70a586393803 |
12 | 287a638b59b0 |
13 | 11889b425452 |
14 | 6dc1865d51a |
15 | 378e462e55c |
hex | 1d6c8993254 |
2022000112212 has 24 divisors (see below), whose sum is σ = 4719043501536. Its totient is φ = 673851003168.
The previous prime is 2022000112193. The next prime is 2022000112213. The reversal of 2022000112212 is 2122110002202.
It is a junction number, because it is equal to n+sod(n) for n = 2022000112191 and 2022000112200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022000112213) 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 7 ways as a sum of consecutive naturals, for example, 18572743 + ... + 18681294.
It is an arithmetic number, because the mean of its divisors is an integer number (196626812564).
Almost surely, 22022000112212 is an apocalyptic number.
It is an amenable number.
2022000112212 is an abundant number, since it is smaller than the sum of its proper divisors (2697043389324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022000112212 is a wasteful number, since it uses less digits than its factorization.
2022000112212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37258567 (or 37258565 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2022000112212 its reverse (2122110002202), we get a palindrome (4144110114414).
The spelling of 2022000112212 in words is "two trillion, twenty-two billion, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •