Base | Representation |
---|---|
bin | 110011011000111000… |
… | …0110001011101100110 |
3 | 101112211221021211122100 |
4 | 1212301300301131212 |
5 | 3302002233111032 |
6 | 122410323312530 |
7 | 10654511033340 |
oct | 1466160613546 |
9 | 345757254570 |
10 | 110356535142 |
11 | 42890429257 |
12 | 1947a21b746 |
13 | a539330849 |
14 | 54ac6b2290 |
15 | 2d0d57297c |
hex | 19b1c31766 |
110356535142 has 48 divisors (see below), whose sum is σ = 279077939712. Its totient is φ = 30859576560.
The previous prime is 110356535137. The next prime is 110356535203. The reversal of 110356535142 is 241535653011.
110356535142 is a `hidden beast` number, since 1 + 1 + 0 + 3 + 565 + 3 + 51 + 42 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 110356535097 and 110356535106.
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 23 ways as a sum of consecutive naturals, for example, 9311584 + ... + 9323427.
It is an arithmetic number, because the mean of its divisors is an integer number (5814123744).
Almost surely, 2110356535142 is an apocalyptic number.
110356535142 is an abundant number, since it is smaller than the sum of its proper divisors (168721404570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110356535142 is a wasteful number, since it uses less digits than its factorization.
110356535142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18635073 (or 18635070 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 110356535142 in words is "one hundred ten billion, three hundred fifty-six million, five hundred thirty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •