Base | Representation |
---|---|
bin | 1011101101001010010… |
… | …0001111000110100100 |
3 | 201020002002101221122201 |
4 | 2323102210033012210 |
5 | 11243323402210040 |
6 | 232215024504244 |
7 | 20346322036564 |
oct | 2732244170644 |
9 | 636062357581 |
10 | 201101210020 |
11 | 78317432627 |
12 | 32b8447b084 |
13 | 15c6b504839 |
14 | 9a3a456da4 |
15 | 536ee98a9a |
hex | 2ed290f1a4 |
201101210020 has 48 divisors (see below), whose sum is σ = 424981948608. Its totient is φ = 79932528000.
The previous prime is 201101209993. The next prime is 201101210021. The reversal of 201101210020 is 20012101102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 201101209979 and 201101210006.
It is not an unprimeable number, because it can be changed into a prime (201101210021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6860395 + ... + 6889645.
It is an arithmetic number, because the mean of its divisors is an integer number (8853790596).
Almost surely, 2201101210020 is an apocalyptic number.
201101210020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201101210020 is an abundant number, since it is smaller than the sum of its proper divisors (223880738588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101210020 is a wasteful number, since it uses less digits than its factorization.
201101210020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31420 (or 31418 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201101210020 its reverse (20012101102), we get a palindrome (221113311122).
The spelling of 201101210020 in words is "two hundred one billion, one hundred one million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •