Base | Representation |
---|---|
bin | 110100011100101001… |
… | …010100110011111001 |
3 | 12101100200221001022120 |
4 | 310130221110303321 |
5 | 1410313140420131 |
6 | 41512033311453 |
7 | 4032354022134 |
oct | 643451246371 |
9 | 171320831276 |
10 | 56315170041 |
11 | 21979499849 |
12 | aab7a05589 |
13 | 5406218430 |
14 | 2a2334121b |
15 | 16e8ed6496 |
hex | d1ca54cf9 |
56315170041 has 16 divisors (see below), whose sum is σ = 81663435840. Its totient is φ = 34312363200.
The previous prime is 56315170007. The next prime is 56315170103. The reversal of 56315170041 is 14007151365.
It is not a de Polignac number, because 56315170041 - 27 = 56315169913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56315169984 and 56315170011.
It is not an unprimeable number, because it can be changed into a prime (56315170141) 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 15 ways as a sum of consecutive naturals, for example, 7144471 + ... + 7152348.
It is an arithmetic number, because the mean of its divisors is an integer number (5103964740).
Almost surely, 256315170041 is an apocalyptic number.
It is an amenable number.
56315170041 is a deficient number, since it is larger than the sum of its proper divisors (25348265799).
56315170041 is a wasteful number, since it uses less digits than its factorization.
56315170041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14296936.
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 56315170041 in words is "fifty-six billion, three hundred fifteen million, one hundred seventy thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •