Base | Representation |
---|---|
bin | 10000001001111001100… |
… | …100010011011010101110 |
3 | 10221010110122101011011002 |
4 | 100021321210103122232 |
5 | 121142032111402342 |
6 | 2205554121000302 |
7 | 143130221562356 |
oct | 20117144233256 |
9 | 3833418334132 |
10 | 1110141122222 |
11 | 3988987a4240 |
12 | 15b1a0023092 |
13 | 808bbaa6802 |
14 | 3ba34283b66 |
15 | 1dd25e37d32 |
hex | 102799136ae |
1110141122222 has 64 divisors (see below), whose sum is σ = 1903213698048. Its totient is φ = 480728160000.
The previous prime is 1110141122203. The next prime is 1110141122257. The reversal of 1110141122222 is 2222211410111.
It is a super-2 number, since 2×11101411222222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110141122194 and 1110141122203.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 283414208 + ... + 283418124.
It is an arithmetic number, because the mean of its divisors is an integer number (29737714032).
Almost surely, 21110141122222 is an apocalyptic number.
1110141122222 is a deficient number, since it is larger than the sum of its proper divisors (793072575826).
1110141122222 is a wasteful number, since it uses less digits than its factorization.
1110141122222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6065.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 1110141122222 its reverse (2222211410111), we get a palindrome (3332352532333).
The spelling of 1110141122222 in words is "one trillion, one hundred ten billion, one hundred forty-one million, one hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •