Base | Representation |
---|---|
bin | 101101101110100011011001… |
… | …101100100101100100100000 |
3 | 222101002001011101101012011110 |
4 | 231232203121230211210200 |
5 | 202330001214424341000 |
6 | 1551421113231343320 |
7 | 60234543020135646 |
oct | 5556433154454440 |
9 | 871061141335143 |
10 | 201111201012000 |
11 | 59097866016454 |
12 | 1a680846381b40 |
13 | 882a9218115b6 |
14 | 3793b96965196 |
15 | 183b56d088850 |
hex | b6e8d9b25920 |
201111201012000 has 192 divisors, whose sum is σ = 658852204518144. Its totient is φ = 53628684134400.
The previous prime is 201111201011909. The next prime is 201111201012013. The reversal of 201111201012000 is 210102111102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 873760932 + ... + 873991068.
It is an arithmetic number, because the mean of its divisors is an integer number (3431521898532).
Almost surely, 2201111201012000 is an apocalyptic number.
201111201012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201111201012000 is an abundant number, since it is smaller than the sum of its proper divisors (457741003506144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111201012000 is a wasteful number, since it uses less digits than its factorization.
201111201012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302988 (or 302970 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201111201012000 its reverse (210102111102), we get a palindrome (201321303123102).
The spelling of 201111201012000 in words is "two hundred one trillion, one hundred eleven billion, two hundred one million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •