Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …000110101110000010010000 |
3 | 112102212102012000001210120212 |
4 | 121002103330012232002100 |
5 | 103413020300333020422 |
6 | 1030103501342023252 |
7 | 32123120503460651 |
oct | 3102237406560220 |
9 | 472772160053525 |
10 | 110110011220112 |
11 | 320a2436854122 |
12 | 10424083b77b28 |
13 | 4959438bc9387 |
14 | 1d294d2805528 |
15 | cae3327c49e2 |
hex | 6424fc1ae090 |
110110011220112 has 40 divisors (see below), whose sum is σ = 225888181802496. Its totient is φ = 51816307882496.
The previous prime is 110110011220091. The next prime is 110110011220123. The reversal of 110110011220112 is 211022110011011.
110110011220112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1101100112201123 (a number of 43 digits) contains 333 as substring.
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 7 ways as a sum of consecutive naturals, for example, 134407613 + ... + 135224355.
Almost surely, 2110110011220112 is an apocalyptic number.
It is an amenable number.
110110011220112 is an abundant number, since it is smaller than the sum of its proper divisors (115778170582384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110011220112 is a wasteful number, since it uses less digits than its factorization.
110110011220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312415 (or 1312409 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110110011220112 its reverse (211022110011011), we get a palindrome (321132121231123).
The spelling of 110110011220112 in words is "one hundred ten trillion, one hundred ten billion, eleven million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •