Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …000101010111001000101100 |
3 | 222101001221022200000200000011 |
4 | 231232202120011113020230 |
5 | 202324441441123211340 |
6 | 1551420412105343004 |
7 | 60234503522363215 |
oct | 5556423005271054 |
9 | 871057280020004 |
10 | 201110100210220 |
11 | 59097350703813 |
12 | 1a680599797a64 |
13 | 882a7a773c9b6 |
14 | 3793ad069840c |
15 | 183b5065e50ea |
hex | b6e89815722c |
201110100210220 has 24 divisors (see below), whose sum is σ = 422694349966224. Its totient is φ = 80374870650816.
The previous prime is 201110100210179. The next prime is 201110100210233. The reversal of 201110100210220 is 22012001011102.
It is a self number, because there is not a number n which added to its sum of digits gives 201110100210220.
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, 4323065739 + ... + 4323112258.
It is an arithmetic number, because the mean of its divisors is an integer number (17612264581926).
Almost surely, 2201110100210220 is an apocalyptic number.
201110100210220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201110100210220 is an abundant number, since it is smaller than the sum of its proper divisors (221584249756004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201110100210220 is a wasteful number, since it uses less digits than its factorization.
201110100210220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8646179169 (or 8646179167 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201110100210220 its reverse (22012001011102), we get a palindrome (223122101221322).
The spelling of 201110100210220 in words is "two hundred one trillion, one hundred ten billion, one hundred million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •