Base | Representation |
---|---|
bin | 11101010101100100001… |
… | …100010001010101011001 |
3 | 21010201200221102122212022 |
4 | 131111210030101111121 |
5 | 231012302233201103 |
6 | 4142051434024225 |
7 | 265436604234110 |
oct | 35254414212531 |
9 | 7121627378768 |
10 | 2016020600153 |
11 | 707a980868aa |
12 | 286875278075 |
13 | 118157680c31 |
14 | 6d80c464c77 |
15 | 376946e2138 |
hex | 1d564311559 |
2016020600153 has 4 divisors (see below), whose sum is σ = 2304023543040. Its totient is φ = 1728017657268.
The previous prime is 2016020600147. The next prime is 2016020600189. The reversal of 2016020600153 is 3510060206102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2016020600153 - 210 = 2016020599129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2016020600053) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 144001471433 + ... + 144001471446.
It is an arithmetic number, because the mean of its divisors is an integer number (576005885760).
Almost surely, 22016020600153 is an apocalyptic number.
It is an amenable number.
2016020600153 is a deficient number, since it is larger than the sum of its proper divisors (288002942887).
2016020600153 is an equidigital number, since it uses as much as digits as its factorization.
2016020600153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288002942886.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 2016020600153 its reverse (3510060206102), we get a palindrome (5526080806255).
The spelling of 2016020600153 in words is "two trillion, sixteen billion, twenty million, six hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •