Base | Representation |
---|---|
bin | 111000111010001011… |
… | …0000000101000101000 |
3 | 102200110002120121112220 |
4 | 1301310112000220220 |
5 | 4000242004323422 |
6 | 132050514034040 |
7 | 11554334311641 |
oct | 1616426005050 |
9 | 380402517486 |
10 | 122211011112 |
11 | 47913a25533 |
12 | 1b828278920 |
13 | b6a82a2878 |
14 | 5cb4c4c6c8 |
15 | 32a4149e5c |
hex | 1c74580a28 |
122211011112 has 64 divisors (see below), whose sum is σ = 307869145920. Its totient is φ = 40425005568.
The previous prime is 122211011077. The next prime is 122211011161. The reversal of 122211011112 is 211110112221.
It is a happy number.
122211011112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 122211011091 and 122211011100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12742783 + ... + 12752369.
It is an arithmetic number, because the mean of its divisors is an integer number (4810455405).
Almost surely, 2122211011112 is an apocalyptic number.
122211011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122211011112 is an abundant number, since it is smaller than the sum of its proper divisors (185658134808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122211011112 is a wasteful number, since it uses less digits than its factorization.
122211011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13610 (or 13606 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122211011112 its reverse (211110112221), we get a palindrome (333321123333).
The spelling of 122211011112 in words is "one hundred twenty-two billion, two hundred eleven million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •