Base | Representation |
---|---|
bin | 1010000110110011110011… |
… | …1001100000010011001110 |
3 | 1110100022021111112111211100 |
4 | 2201230330321200103032 |
5 | 2424030041114232342 |
6 | 35344455040403530 |
7 | 2224552151264562 |
oct | 241547471402316 |
9 | 43308244474740 |
10 | 11112102102222 |
11 | 35a4685a43590 |
12 | 12b57246165a6 |
13 | 627b36296914 |
14 | 2a5b859d16a2 |
15 | 1440b80d1e4c |
hex | a1b3ce604ce |
11112102102222 has 48 divisors (see below), whose sum is σ = 26905577615280. Its totient is φ = 3285174307200.
The previous prime is 11112102102217. The next prime is 11112102102247. The reversal of 11112102102222 is 22220120121111.
11112102102222 is a `hidden beast` number, since 11 + 11 + 210 + 210 + 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 = 11112102102195 and 11112102102204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 684403197 + ... + 684419432.
It is an arithmetic number, because the mean of its divisors is an integer number (560532866985).
Almost surely, 211112102102222 is an apocalyptic number.
11112102102222 is an abundant number, since it is smaller than the sum of its proper divisors (15793475513058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112102102222 is a wasteful number, since it uses less digits than its factorization.
11112102102222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368822689 (or 1368822686 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11112102102222 its reverse (22220120121111), we get a palindrome (33332222223333).
The spelling of 11112102102222 in words is "eleven trillion, one hundred twelve billion, one hundred two million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •