Base | Representation |
---|---|
bin | 1011101110010100101… |
… | …0011011010110010000 |
3 | 201020212211111021021102 |
4 | 2323211022123112100 |
5 | 11244443240232121 |
6 | 232310012043532 |
7 | 20360131023155 |
oct | 2734512332620 |
9 | 636784437242 |
10 | 201413211536 |
11 | 78467563a19 |
12 | 33050a635a8 |
13 | 15cbb045214 |
14 | 9a69a7222c |
15 | 538c57890b |
hex | 2ee529b590 |
201413211536 has 40 divisors (see below), whose sum is σ = 410826324480. Its totient is φ = 95394789504.
The previous prime is 201413211529. The next prime is 201413211583. The reversal of 201413211536 is 635112314102.
201413211536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201413211499 and 201413211508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2833745 + ... + 2903951.
It is an arithmetic number, because the mean of its divisors is an integer number (10270658112).
Almost surely, 2201413211536 is an apocalyptic number.
It is an amenable number.
201413211536 is an abundant number, since it is smaller than the sum of its proper divisors (209413112944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201413211536 is a wasteful number, since it uses less digits than its factorization.
201413211536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79671 (or 79665 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 201413211536 its reverse (635112314102), we get a palindrome (836525525638).
The spelling of 201413211536 in words is "two hundred one billion, four hundred thirteen million, two hundred eleven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •