Base | Representation |
---|---|
bin | 110100001001111001… |
… | …100100001000101111 |
3 | 12100112210010021200002 |
4 | 310021321210020233 |
5 | 1404142132110030 |
6 | 41420520254515 |
7 | 4021514520236 |
oct | 641171441057 |
9 | 170483107602 |
10 | 56000660015 |
11 | 21827a04803 |
12 | aa2a61143b |
13 | 538600a021 |
14 | 29d3671b1d |
15 | 16cb5ad245 |
hex | d09e6422f |
56000660015 has 32 divisors (see below), whose sum is σ = 70549401600. Its totient is φ = 42592556160.
The previous prime is 56000660003. The next prime is 56000660029. The reversal of 56000660015 is 51006600065.
It is not a de Polignac number, because 56000660015 - 210 = 56000658991 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56000660015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17341421 + ... + 17344649.
It is an arithmetic number, because the mean of its divisors is an integer number (2204668800).
Almost surely, 256000660015 is an apocalyptic number.
56000660015 is a deficient number, since it is larger than the sum of its proper divisors (14548741585).
56000660015 is a wasteful number, since it uses less digits than its factorization.
56000660015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4127.
The product of its (nonzero) digits is 5400, while the sum is 29.
The spelling of 56000660015 in words is "fifty-six billion, six hundred sixty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •