Base | Representation |
---|---|
bin | 11110100101101010001… |
… | …110001100000110011110 |
3 | 21102221200110120022222000 |
4 | 132211222032030012132 |
5 | 233414414401042342 |
6 | 4245353303303130 |
7 | 304603020436023 |
oct | 36455216140636 |
9 | 7387613508860 |
10 | 2102021112222 |
11 | 74050a133469 |
12 | 29b47674aaa6 |
13 | 1232b1a008b5 |
14 | 73a4a10354a |
15 | 39a2989a44c |
hex | 1e96a38c19e |
2102021112222 has 16 divisors (see below), whose sum is σ = 4671158027280. Its totient is φ = 700673704056.
The previous prime is 2102021112203. The next prime is 2102021112239. The reversal of 2102021112222 is 2222111202012.
It is a happy number.
2102021112222 is a `hidden beast` number, since 210 + 20 + 211 + 1 + 2 + 222 = 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 = 2102021112195 and 2102021112204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19463158393 + ... + 19463158500.
It is an arithmetic number, because the mean of its divisors is an integer number (291947376705).
Almost surely, 22102021112222 is an apocalyptic number.
2102021112222 is an abundant number, since it is smaller than the sum of its proper divisors (2569136915058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102021112222 is a wasteful number, since it uses less digits than its factorization.
2102021112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38926316904 (or 38926316898 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2102021112222 its reverse (2222111202012), we get a palindrome (4324132314234).
The spelling of 2102021112222 in words is "two trillion, one hundred two billion, twenty-one million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •