Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …101100011100100101010011 |
3 | 112102212102012200200021002200 |
4 | 121002103330230130211103 |
5 | 103413020310401010344 |
6 | 1030103502334014243 |
7 | 32123120653521513 |
oct | 3102237454344523 |
9 | 472772180607080 |
10 | 110110021110099 |
11 | 320a244139966a |
12 | 10424087347383 |
13 | 495943ac7cb3a |
14 | 1d294d3c5b843 |
15 | cae3335ca069 |
hex | 6424fcb1c953 |
110110021110099 has 192 divisors, whose sum is σ = 166895981051904. Its totient is φ = 69917985865728.
The previous prime is 110110021110043. The next prime is 110110021110119. The reversal of 110110021110099 is 990011120011011.
It is not a de Polignac number, because 110110021110099 - 27 = 110110021109971 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110110021210099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 248555352172 + ... + 248555352614.
It is an arithmetic number, because the mean of its divisors is an integer number (869249901312).
Almost surely, 2110110021110099 is an apocalyptic number.
110110021110099 is a deficient number, since it is larger than the sum of its proper divisors (56785959941805).
110110021110099 is a wasteful number, since it uses less digits than its factorization.
110110021110099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1146 (or 1143 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 27.
The spelling of 110110021110099 in words is "one hundred ten trillion, one hundred ten billion, twenty-one million, one hundred ten thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •