Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …101101101010010000010111 |
3 | 222101001221002101111011002222 |
4 | 231232202102231222100113 |
5 | 202324441300042022444 |
6 | 1551420355130252555 |
7 | 60234501346505243 |
oct | 5556422255522027 |
9 | 871057071434088 |
10 | 201110010110999 |
11 | 59097304864950 |
12 | 1a68057358715b |
13 | 882a791b84852 |
14 | 3793ac2723423 |
15 | 183b4ed748eee |
hex | b6e892b6a417 |
201110010110999 has 16 divisors (see below), whose sum is σ = 219603928978944. Its totient is φ = 182651308257600.
The previous prime is 201110010110993. The next prime is 201110010111007. The reversal of 201110010110999 is 999011010011102.
201110010110999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 201110010110999 - 212 = 201110010106903 is a prime.
It is a super-2 number, since 2×2011100101109992 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201110010110993) 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, 220766444 + ... + 221675534.
It is an arithmetic number, because the mean of its divisors is an integer number (13725245561184).
Almost surely, 2201110010110999 is an apocalyptic number.
201110010110999 is a deficient number, since it is larger than the sum of its proper divisors (18493918867945).
201110010110999 is a wasteful number, since it uses less digits than its factorization.
201110010110999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 928438.
The product of its (nonzero) digits is 1458, while the sum is 35.
The spelling of 201110010110999 in words is "two hundred one trillion, one hundred ten billion, ten million, one hundred ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •