Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …111111100100101010011011 |
3 | 112102212102102212221211212000 |
4 | 121002110001333210222123 |
5 | 103413021001130310021 |
6 | 1030103515231252043 |
7 | 32123123113253106 |
oct | 3102240177445233 |
9 | 472772385854760 |
10 | 110110110010011 |
11 | 320a2487599471 |
12 | 104240b107a023 |
13 | 4959453508137 |
14 | 1d2950199d73d |
15 | cae33b2dab26 |
hex | 642501fe4a9b |
110110110010011 has 16 divisors (see below), whose sum is σ = 168388220805120. Its totient is φ = 71038780651080.
The previous prime is 110110110010009. The next prime is 110110110010027. The reversal of 110110110010011 is 110010011011011.
It is not a de Polignac number, because 110110110010011 - 21 = 110110110010009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110110110009975 and 110110110010002.
It is not an unprimeable number, because it can be changed into a prime (110110110010051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65776647915 + ... + 65776649588.
It is an arithmetic number, because the mean of its divisors is an integer number (10524263800320).
Almost surely, 2110110110010011 is an apocalyptic number.
110110110010011 is a deficient number, since it is larger than the sum of its proper divisors (58278110795109).
110110110010011 is a wasteful number, since it uses less digits than its factorization.
110110110010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131553297543 (or 131553297537 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 110110110010011 its reverse (110010011011011), we get a palindrome (220120121021022).
The spelling of 110110110010011 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •