Base | Representation |
---|---|
bin | 11101010101100011100… |
… | …101110010001010100011 |
3 | 21010201200020110002011101 |
4 | 131111203211302022203 |
5 | 231012242142323021 |
6 | 4142050433455231 |
7 | 265436422413520 |
oct | 35254345621243 |
9 | 7121606402141 |
10 | 2016010511011 |
11 | 707a92415772 |
12 | 286871a11517 |
13 | 11815555a923 |
14 | 6d80ad9a147 |
15 | 3769389ca91 |
hex | 1d5639722a3 |
2016010511011 has 32 divisors (see below), whose sum is σ = 2436975659520. Its totient is φ = 1633707925920.
The previous prime is 2016010510991. The next prime is 2016010511029. The reversal of 2016010511011 is 1101150106102.
It is not a de Polignac number, because 2016010511011 - 29 = 2016010510499 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2016010511011.
It is not an unprimeable number, because it can be changed into a prime (2016010511051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23531625 + ... + 23617141.
It is an arithmetic number, because the mean of its divisors is an integer number (76155489360).
Almost surely, 22016010511011 is an apocalyptic number.
2016010511011 is a deficient number, since it is larger than the sum of its proper divisors (420965148509).
2016010511011 is an frugal number, since it uses more digits than its factorization.
2016010511011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86072 (or 86034 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 19.
Adding to 2016010511011 its reverse (1101150106102), we get a palindrome (3117160617113).
The spelling of 2016010511011 in words is "two trillion, sixteen billion, ten million, five hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •