Base | Representation |
---|---|
bin | 11001100111110001011100… |
… | …00100011000001000000000 |
3 | 21101111020221120121020111210 |
4 | 30303320232010120020000 |
5 | 24341102212343411011 |
6 | 315455121141410120 |
7 | 14603405045123235 |
oct | 1463705604301000 |
9 | 241436846536453 |
10 | 56342153888256 |
11 | 16a5263403aa15 |
12 | 639b5a1409940 |
13 | 2559071c6bc02 |
14 | dcad90bbd78c |
15 | 67a8c6dec6a6 |
hex | 333e2e118200 |
56342153888256 has 160 divisors (see below), whose sum is σ = 158945219801280. Its totient is φ = 17674096214016.
The previous prime is 56342153888221. The next prime is 56342153888287. The reversal of 56342153888256 is 65288835124365.
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 15 ways as a sum of consecutive naturals, for example, 257328780 + ... + 257547636.
It is an arithmetic number, because the mean of its divisors is an integer number (993407623758).
Almost surely, 256342153888256 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 56342153888256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79472609900640).
56342153888256 is an abundant number, since it is smaller than the sum of its proper divisors (102603065913024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56342153888256 is a wasteful number, since it uses less digits than its factorization.
56342153888256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228754 (or 228738 counting only the distinct ones).
The product of its digits is 331776000, while the sum is 66.
The spelling of 56342153888256 in words is "fifty-six trillion, three hundred forty-two billion, one hundred fifty-three million, eight hundred eighty-eight thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •