Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …101110111110101011110000 |
3 | 222101001221100102112221120020 |
4 | 231232202120232332223300 |
5 | 202324442001421320422 |
6 | 1551420413135243440 |
7 | 60234504014202405 |
oct | 5556423056765360 |
9 | 871057312487506 |
10 | 201110111120112 |
11 | 59097356885557 |
12 | 1a6805a1379580 |
13 | 882a7a9a8c75c |
14 | 3793ad1cd82ac |
15 | 183b50754c95c |
hex | b6e898bbeaf0 |
201110111120112 has 80 divisors (see below), whose sum is σ = 520305170674080. Its totient is φ = 66937270173696.
The previous prime is 201110111120099. The next prime is 201110111120117. The reversal of 201110111120112 is 211021111011102.
It is a junction number, because it is equal to n+sod(n) for n = 201110111120091 and 201110111120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201110111120117) 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, 482263248 + ... + 482680080.
It is an arithmetic number, because the mean of its divisors is an integer number (6503814633426).
Almost surely, 2201110111120112 is an apocalyptic number.
It is an amenable number.
201110111120112 is an abundant number, since it is smaller than the sum of its proper divisors (319195059553968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201110111120112 is a wasteful number, since it uses less digits than its factorization.
201110111120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431730 (or 431724 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 201110111120112 its reverse (211021111011102), we get a palindrome (412131222131214).
The spelling of 201110111120112 in words is "two hundred one trillion, one hundred ten billion, one hundred eleven million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •