Base | Representation |
---|---|
bin | 101101101110100011010100… |
… | …010101101011010010001010 |
3 | 222101002000221010020012112111 |
4 | 231232203110111223102022 |
5 | 202330001023421320020 |
6 | 1551421100300532534 |
7 | 60234540546103120 |
oct | 5556432425532212 |
9 | 871060833205474 |
10 | 201111111120010 |
11 | 5909781a2a9253 |
12 | 1a68082025114a |
13 | 882a908cc9880 |
14 | 3793b88a45910 |
15 | 183b56522dd5a |
hex | b6e8d456b48a |
201111111120010 has 256 divisors, whose sum is σ = 462878710963200. Its totient is φ = 61190304989184.
The previous prime is 201111111119911. The next prime is 201111111120011. The reversal of 201111111120010 is 10021111111102.
201111111120010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (201111111120011) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 11834930074 + ... + 11834947066.
It is an arithmetic number, because the mean of its divisors is an integer number (1808119964700).
Almost surely, 2201111111120010 is an apocalyptic number.
201111111120010 is an abundant number, since it is smaller than the sum of its proper divisors (261767599843190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111111120010 is a wasteful number, since it uses less digits than its factorization.
201111111120010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18945.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 201111111120010 its reverse (10021111111102), we get a palindrome (211132222231112).
The spelling of 201111111120010 in words is "two hundred one trillion, one hundred eleven billion, one hundred eleven million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •