Base | Representation |
---|---|
bin | 101101101110101011100111… |
… | …011010100011011010110100 |
3 | 222101002212221001221002121020 |
4 | 231232223213122203122310 |
5 | 202330122300400201322 |
6 | 1551425132344421140 |
7 | 60235304416506564 |
oct | 5556534732433264 |
9 | 871085831832536 |
10 | 201120021100212 |
11 | 590a05817a5255 |
12 | 1a6824a81777b0 |
13 | 882b6c8c1bbc6 |
14 | 3794392106da4 |
15 | 183b8d757805c |
hex | b6eae76a36b4 |
201120021100212 has 24 divisors (see below), whose sum is σ = 472159067945376. Its totient is φ = 66628718646048.
The previous prime is 201120021100199. The next prime is 201120021100249. The reversal of 201120021100212 is 212001120021102.
It is a super-3 number, since 3×2011200211002123 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201120021100191 and 201120021100200.
It is a congruent number.
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, 51411046383 + ... + 51411050294.
It is an arithmetic number, because the mean of its divisors is an integer number (19673294497724).
Almost surely, 2201120021100212 is an apocalyptic number.
It is an amenable number.
201120021100212 is an abundant number, since it is smaller than the sum of its proper divisors (271039046845164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201120021100212 is a wasteful number, since it uses less digits than its factorization.
201120021100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102822096847 (or 102822096845 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201120021100212 its reverse (212001120021102), we get a palindrome (413121141121314).
The spelling of 201120021100212 in words is "two hundred one trillion, one hundred twenty billion, twenty-one million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •