Base | Representation |
---|---|
bin | 101111110010110101000010… |
… | …100000010100011010011100 |
3 | 1000120021000210210012002202020 |
4 | 233302311002200110122130 |
5 | 210022413333202431022 |
6 | 2023021020144100140 |
7 | 62163346315332516 |
oct | 5762650240243234 |
9 | 1016230723162666 |
10 | 210201110202012 |
11 | 60a81876860796 |
12 | 1b6aa472604650 |
13 | 9039b58749a27 |
14 | 39c9b0646abb6 |
15 | 1947c2eb5535c |
hex | bf2d4281469c |
210201110202012 has 12 divisors (see below), whose sum is σ = 490469257138056. Its totient is φ = 70067036734000.
The previous prime is 210201110201941. The next prime is 210201110202059. The reversal of 210201110202012 is 210202011102012.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 210201110201982 and 210201110202000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8758379591739 + ... + 8758379591762.
It is an arithmetic number, because the mean of its divisors is an integer number (40872438094838).
Almost surely, 2210201110202012 is an apocalyptic number.
It is an amenable number.
210201110202012 is an abundant number, since it is smaller than the sum of its proper divisors (280268146936044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201110202012 is a wasteful number, since it uses less digits than its factorization.
210201110202012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17516759183508 (or 17516759183506 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210201110202012 its reverse (210202011102012), we get a palindrome (420403121304024).
The spelling of 210201110202012 in words is "two hundred ten trillion, two hundred one billion, one hundred ten million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •