Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111011010000101101011101 |
3 | 112102110220020010120100100020 |
4 | 121000231132323100231131 |
5 | 103404220000000323401 |
6 | 1025541145152022353 |
7 | 32112144354564114 |
oct | 3100553673205535 |
9 | 472426203510306 |
10 | 110000000011101 |
11 | 3205a813348572 |
12 | 104068a15319b9 |
13 | 494bc562a6525 |
14 | 1d24057d44c7b |
15 | cab544715d36 |
hex | 640b5eed0b5d |
110000000011101 has 32 divisors (see below), whose sum is σ = 152125095936768. Its totient is φ = 70643475302400.
The previous prime is 110000000011093. The next prime is 110000000011189. The reversal of 110000000011101 is 101110000000011.
It is not a de Polignac number, because 110000000011101 - 23 = 110000000011093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110000000011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000000011301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1077292416 + ... + 1077394518.
It is an arithmetic number, because the mean of its divisors is an integer number (4753909248024).
Almost surely, 2110000000011101 is an apocalyptic number.
It is an amenable number.
110000000011101 is a deficient number, since it is larger than the sum of its proper divisors (42125095925667).
110000000011101 is a wasteful number, since it uses less digits than its factorization.
110000000011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198341.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110000000011101 its reverse (101110000000011), we get a palindrome (211110000011112).
It can be divided in two parts, 110000000011 and 101, that multiplied together give a palindrome (11110000001111).
The spelling of 110000000011101 in words is "one hundred ten trillion, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •