Base | Representation |
---|---|
bin | 110100101001110110… |
… | …011111101001111101 |
3 | 12101221010211021011001 |
4 | 310221312133221331 |
5 | 1411241400214031 |
6 | 41550030130301 |
7 | 4041014146240 |
oct | 645166375175 |
9 | 171833737131 |
10 | 56536726141 |
11 | 21a82565165 |
12 | ab5a050991 |
13 | 54400ac20c |
14 | 2a44935257 |
15 | 170d69c861 |
hex | d29d9fa7d |
56536726141 has 16 divisors (see below), whose sum is σ = 68449860864. Its totient is φ = 45585679104.
The previous prime is 56536726139. The next prime is 56536726157. The reversal of 56536726141 is 14162763565.
It is not a de Polignac number, because 56536726141 - 21 = 56536726139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56536726091 and 56536726100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56536706141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107136 + ... + 352918.
It is an arithmetic number, because the mean of its divisors is an integer number (4278116304).
Almost surely, 256536726141 is an apocalyptic number.
It is an amenable number.
56536726141 is a deficient number, since it is larger than the sum of its proper divisors (11913134723).
56536726141 is a wasteful number, since it uses less digits than its factorization.
56536726141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247740.
The product of its digits is 907200, while the sum is 46.
The spelling of 56536726141 in words is "fifty-six billion, five hundred thirty-six million, seven hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •