Base | Representation |
---|---|
bin | 11001000001100001001011… |
… | …100110111110001100010010 |
3 | 112102200012111202100100210202 |
4 | 121001201023212332030102 |
5 | 103411122141142000424 |
6 | 1030022445322255202 |
7 | 32116151101135364 |
oct | 3101411346761422 |
9 | 472605452310722 |
10 | 110055510500114 |
11 | 32081309599573 |
12 | 104155b3957502 |
13 | 495426189022a |
14 | 1d26a0245cd34 |
15 | cacbe2c4d2ae |
hex | 64184b9be312 |
110055510500114 has 8 divisors (see below), whose sum is σ = 165083673394560. Its totient is φ = 55027619368596.
The previous prime is 110055510500099. The next prime is 110055510500119. The reversal of 110055510500114 is 411005015550011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100555105001142 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110055510500119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66925274 + ... + 68550005.
It is an arithmetic number, because the mean of its divisors is an integer number (20635459174320).
Almost surely, 2110055510500114 is an apocalyptic number.
110055510500114 is a deficient number, since it is larger than the sum of its proper divisors (55028162894446).
110055510500114 is a wasteful number, since it uses less digits than its factorization.
110055510500114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135881464.
The product of its (nonzero) digits is 2500, while the sum is 29.
The spelling of 110055510500114 in words is "one hundred ten trillion, fifty-five billion, five hundred ten million, five hundred thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.245 sec. • engine limits •