Base | Representation |
---|---|
bin | 101101101101000110000101… |
… | …010000000011111001101110 |
3 | 222100201110112012111101102221 |
4 | 231231012011100003321232 |
5 | 202321331012000000420 |
6 | 1551303102324105554 |
7 | 60224364652446646 |
oct | 5555060520037156 |
9 | 870643465441387 |
10 | 201011000000110 |
11 | 59059317177123 |
12 | 1a6653412352ba |
13 | 8821343482111 |
14 | 378cdacd3b526 |
15 | 1838b56394caa |
hex | b6d185403e6e |
201011000000110 has 8 divisors (see below), whose sum is σ = 361819800000216. Its totient is φ = 80404400000040.
The previous prime is 201011000000059. The next prime is 201011000000113. The reversal of 201011000000110 is 11000000110102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201011000000093 and 201011000000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011000000113) 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 3 ways as a sum of consecutive naturals, for example, 10050549999996 + ... + 10050550000015.
It is an arithmetic number, because the mean of its divisors is an integer number (45227475000027).
Almost surely, 2201011000000110 is an apocalyptic number.
201011000000110 is a deficient number, since it is larger than the sum of its proper divisors (160808800000106).
201011000000110 is a wasteful number, since it uses less digits than its factorization.
201011000000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20101100000018.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 201011000000110 its reverse (11000000110102), we get a palindrome (212011000110212).
The spelling of 201011000000110 in words is "two hundred one trillion, eleven billion, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •