Base | Representation |
---|---|
bin | 1011101101010001011… |
… | …1000011111000011000 |
3 | 201020011012001012220121 |
4 | 2323110113003320120 |
5 | 11243404103414431 |
6 | 232222022003024 |
7 | 20350135634455 |
oct | 2732427037030 |
9 | 636135035817 |
10 | 201131310616 |
11 | 78332421655 |
12 | 32b92576474 |
13 | 15c74813542 |
14 | 9a4045082c |
15 | 5372942611 |
hex | 2ed45c3e18 |
201131310616 has 32 divisors (see below), whose sum is σ = 404153411040. Its totient is φ = 93593415168.
The previous prime is 201131310587. The next prime is 201131310659. The reversal of 201131310616 is 616013131102.
201131310616 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2011313106162 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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, 14764881 + ... + 14778496.
It is an arithmetic number, because the mean of its divisors is an integer number (12629794095).
Almost surely, 2201131310616 is an apocalyptic number.
It is an amenable number.
201131310616 is an abundant number, since it is smaller than the sum of its proper divisors (203022100424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201131310616 is a wasteful number, since it uses less digits than its factorization.
201131310616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29543443 (or 29543439 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 201131310616 its reverse (616013131102), we get a palindrome (817144441718).
The spelling of 201131310616 in words is "two hundred one billion, one hundred thirty-one million, three hundred ten thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •