Base | Representation |
---|---|
bin | 111100000110001… |
… | …0110110010110101 |
3 | 12012112102001211212 |
4 | 1320030112302311 |
5 | 13112211130023 |
6 | 532032411205 |
7 | 100654003235 |
oct | 17014266265 |
9 | 5175361755 |
10 | 2016505013 |
11 | 9452a0076 |
12 | 4833a6b05 |
13 | 261a05a43 |
14 | 151b53cc5 |
15 | bc072e78 |
hex | 78316cb5 |
2016505013 has 8 divisors (see below), whose sum is σ = 2104647936. Its totient is φ = 1928401200.
The previous prime is 2016504991. The next prime is 2016505021. The reversal of 2016505013 is 3105056102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2016505013 - 26 = 2016504949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 2016505013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2016505033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154523 + ... + 167063.
It is an arithmetic number, because the mean of its divisors is an integer number (263080992).
Almost surely, 22016505013 is an apocalyptic number.
2016505013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2016505013 is a deficient number, since it is larger than the sum of its proper divisors (88142923).
2016505013 is a wasteful number, since it uses less digits than its factorization.
2016505013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19555.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 2016505013 is about 44905.5120558713. The cubic root of 2016505013 is about 1263.3773949741.
The spelling of 2016505013 in words is "two billion, sixteen million, five hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •