Base | Representation |
---|---|
bin | 11001011101111110011111… |
… | …11010010110110001000000 |
3 | 21100022002011020112012201211 |
4 | 30232333033322112301000 |
5 | 24320043400042110411 |
6 | 315040334023135504 |
7 | 14540161103520346 |
oct | 1456771772266100 |
9 | 240262136465654 |
10 | 56005566753856 |
11 | 16932911409065 |
12 | 6346306ba4594 |
13 | 25333c1169865 |
14 | db8980869996 |
15 | 671c776a1221 |
hex | 32efcfe96c40 |
56005566753856 has 112 divisors (see below), whose sum is σ = 122794911916416. Its totient is φ = 25208596537344.
The previous prime is 56005566753853. The next prime is 56005566753869. The reversal of 56005566753856 is 65835766550065.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 56005566753791 and 56005566753800.
It is not an unprimeable number, because it can be changed into a prime (56005566753853) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1078933855 + ... + 1078985761.
Almost surely, 256005566753856 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56005566753856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61397455958208).
56005566753856 is an abundant number, since it is smaller than the sum of its proper divisors (66789345162560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56005566753856 is a wasteful number, since it uses less digits than its factorization.
56005566753856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95076 (or 95066 counting only the distinct ones).
The product of its (nonzero) digits is 680400000, while the sum is 67.
The spelling of 56005566753856 in words is "fifty-six trillion, five billion, five hundred sixty-six million, seven hundred fifty-three thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •