Base | Representation |
---|---|
bin | 10000000010100001100… |
… | …011010010101101010110 |
3 | 10220101000202011122002200 |
4 | 100002201203102231112 |
5 | 121024322313324342 |
6 | 2202204230545330 |
7 | 142430042340243 |
oct | 20024143225526 |
9 | 3811022148080 |
10 | 1102222011222 |
11 | 3954a4654a02 |
12 | 15974bb08246 |
13 | 7cc29245607 |
14 | 3b4c26345ca |
15 | 1da10ab994c |
hex | 100a18d2b56 |
1102222011222 has 24 divisors (see below), whose sum is σ = 2390110061976. Its totient is φ = 367105433856.
The previous prime is 1102222011199. The next prime is 1102222011251. The reversal of 1102222011222 is 2221102222011.
It is a happy number.
It is a super-3 number, since 3×11022220112223 (a number of 37 digits) contains 333 as substring.
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 = 1102222011195 and 1102222011204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25136088 + ... + 25179899.
It is an arithmetic number, because the mean of its divisors is an integer number (99587919249).
Almost surely, 21102222011222 is an apocalyptic number.
1102222011222 is an abundant number, since it is smaller than the sum of its proper divisors (1287888050754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102222011222 is a wasteful number, since it uses less digits than its factorization.
1102222011222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50317212 (or 50317209 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1102222011222 its reverse (2221102222011), we get a palindrome (3323324233233).
The spelling of 1102222011222 in words is "one trillion, one hundred two billion, two hundred twenty-two million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •