Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …000001001110110000011 |
3 | 10221010010111200000101022 |
4 | 100021301300021312003 |
5 | 121141300030323021 |
6 | 2205533114500055 |
7 | 143124040263056 |
oct | 20116160116603 |
9 | 3833114600338 |
10 | 1110010011011 |
11 | 398830793470 |
12 | 15b16413462b |
13 | 8089a88c305 |
14 | 3ba20ab4a9d |
15 | 1dd1968a1ab |
hex | 10271c09d83 |
1110010011011 has 16 divisors (see below), whose sum is σ = 1219773316608. Its totient is φ = 1001738155200.
The previous prime is 1110010010981. The next prime is 1110010011017. The reversal of 1110010011011 is 1101100100111.
It is a cyclic number.
It is not a de Polignac number, because 1110010011011 - 226 = 1109942902147 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1110010011011.
It is not an unprimeable number, because it can be changed into a prime (1110010011017) 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, 1000946 + ... + 1794968.
It is an arithmetic number, because the mean of its divisors is an integer number (76235832288).
Almost surely, 21110010011011 is an apocalyptic number.
1110010011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1110010011011 is a deficient number, since it is larger than the sum of its proper divisors (109763305597).
1110010011011 is a wasteful number, since it uses less digits than its factorization.
1110010011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 794962.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1110010011011 its reverse (1101100100111), we get a palindrome (2211110111122).
It can be divided in two parts, 11100100 and 11011, that added together give a palindrome (11111111).
The spelling of 1110010011011 in words is "one trillion, one hundred ten billion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •