Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …001100001100010111010110 |
3 | 222101001221022210101122122102 |
4 | 231232202120030030113112 |
5 | 202324441442103013420 |
6 | 1551420412212002102 |
7 | 60234503543532401 |
oct | 5556423014142726 |
9 | 871057283348572 |
10 | 201110102001110 |
11 | 59097351717295 |
12 | 1a68059a300332 |
13 | 882a7a7c18bb3 |
14 | 3793ad0a02d38 |
15 | 183b50684aa75 |
hex | b6e89830c5d6 |
201110102001110 has 32 divisors (see below), whose sum is σ = 367644941379072. Its totient is φ = 79197889720320.
The previous prime is 201110102001089. The next prime is 201110102001119. The reversal of 201110102001110 is 11100201011102.
It is a junction number, because it is equal to n+sod(n) for n = 201110102001091 and 201110102001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201110102001119) 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 15 ways as a sum of consecutive naturals, for example, 542563427 + ... + 542933966.
It is an arithmetic number, because the mean of its divisors is an integer number (11488904418096).
Almost surely, 2201110102001110 is an apocalyptic number.
201110102001110 is a deficient number, since it is larger than the sum of its proper divisors (166534839377962).
201110102001110 is a wasteful number, since it uses less digits than its factorization.
201110102001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1085497688.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201110102001110 its reverse (11100201011102), we get a palindrome (212210303012212).
The spelling of 201110102001110 in words is "two hundred one trillion, one hundred ten billion, one hundred two million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •