Base | Representation |
---|---|
bin | 11001101101011010111010… |
… | …01110101101000010000001 |
3 | 21102011210212021200201120211 |
4 | 30312231131032231002001 |
5 | 24402242133433342201 |
6 | 320124214051034121 |
7 | 14623415126321626 |
oct | 1466553516550201 |
9 | 242153767621524 |
10 | 56536218652801 |
11 | 1701796a595948 |
12 | 641112129b941 |
13 | 257145b749b34 |
14 | dd652091034d |
15 | 68098427d651 |
hex | 336b5d3ad081 |
56536218652801 has 16 divisors (see below), whose sum is σ = 60003222491520. Its totient is φ = 53084939846400.
The previous prime is 56536218652751. The next prime is 56536218652811. The reversal of 56536218652801 is 10825681263565.
56536218652801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 56536218652801 - 211 = 56536218650753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56536218652811) 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, 91314726 + ... + 91931776.
It is an arithmetic number, because the mean of its divisors is an integer number (3750201405720).
Almost surely, 256536218652801 is an apocalyptic number.
It is an amenable number.
56536218652801 is a deficient number, since it is larger than the sum of its proper divisors (3467003838719).
56536218652801 is a wasteful number, since it uses less digits than its factorization.
56536218652801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629784.
The product of its (nonzero) digits is 20736000, while the sum is 58.
The spelling of 56536218652801 in words is "fifty-six trillion, five hundred thirty-six billion, two hundred eighteen million, six hundred fifty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •