Base | Representation |
---|---|
bin | 11001000010011101010000… |
… | …101111011011000011101110 |
3 | 112102220101000121102221111020 |
4 | 121002131100233123003232 |
5 | 103413201300401023042 |
6 | 1030112234520435010 |
7 | 32123623531236246 |
oct | 3102352057330356 |
9 | 472811017387436 |
10 | 110120021111022 |
11 | 320a670310433a |
12 | 10425bb8318a66 |
13 | 495a37296a850 |
14 | 1d29ba1dc0b26 |
15 | cae71b4883ec |
hex | 642750bdb0ee |
110120021111022 has 16 divisors (see below), whose sum is σ = 237181583931600. Its totient is φ = 33883083418752.
The previous prime is 110120021110951. The next prime is 110120021111117. The reversal of 110120021111022 is 220111120021011.
It is a happy number.
110120021111022 is digitally balanced in base 4, 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 = 110120021110992 and 110120021111010.
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, 705897571147 + ... + 705897571302.
It is an arithmetic number, because the mean of its divisors is an integer number (14823848995725).
Almost surely, 2110120021111022 is an apocalyptic number.
110120021111022 is an abundant number, since it is smaller than the sum of its proper divisors (127061562820578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110120021111022 is a wasteful number, since it uses less digits than its factorization.
110120021111022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1411795142467.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110120021111022 its reverse (220111120021011), we get a palindrome (330231141132033).
The spelling of 110120021111022 in words is "one hundred ten trillion, one hundred twenty billion, twenty-one million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •