Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …110001101111010100000100 |
3 | 222100201120121211112020221011 |
4 | 231231013030301233110010 |
5 | 202321340441200323022 |
6 | 1551303421352332004 |
7 | 60224436463412005 |
oct | 5555071461572404 |
9 | 870646554466834 |
10 | 201012200011012 |
11 | 59059882590075 |
12 | 1a6656170a4004 |
13 | 88214a4c7b540 |
14 | 378d0844711ac |
15 | 1838bc68d3977 |
hex | b6d1ccc6f504 |
201012200011012 has 24 divisors (see below), whose sum is σ = 395301583970496. Its totient is φ = 88741171910688.
The previous prime is 201012200010977. The next prime is 201012200011027. The reversal of 201012200011012 is 210110002210102.
201012200011012 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 a junction number, because it is equal to n+sod(n) for n = 201012200010983 and 201012200011001.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84035199478 + ... + 84035201869.
It is an arithmetic number, because the mean of its divisors is an integer number (16470899332104).
Almost surely, 2201012200011012 is an apocalyptic number.
It is an amenable number.
201012200011012 is a deficient number, since it is larger than the sum of its proper divisors (194289383959484).
201012200011012 is a wasteful number, since it uses less digits than its factorization.
201012200011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168070401387 (or 168070401385 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201012200011012 its reverse (210110002210102), we get a palindrome (411122202221114).
The spelling of 201012200011012 in words is "two hundred one trillion, twelve billion, two hundred million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •