Base | Representation |
---|---|
bin | 110100001001111110… |
… | …001000100110100000 |
3 | 12100112212101010221010 |
4 | 310021332020212200 |
5 | 1404142433423302 |
6 | 41421002100520 |
7 | 4021530636615 |
oct | 641176104640 |
9 | 170485333833 |
10 | 56001857952 |
11 | 21828652837 |
12 | aa2aaaa740 |
13 | 5386339371 |
14 | 29d38a450c |
15 | 16cb74816c |
hex | d09f889a0 |
56001857952 has 96 divisors (see below), whose sum is σ = 154820635200. Its totient is φ = 17675808768.
The previous prime is 56001857903. The next prime is 56001857959. The reversal of 56001857952 is 25975810065.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (56001857959) 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, 4204968 + ... + 4218264.
It is an arithmetic number, because the mean of its divisors is an integer number (1612714950).
Almost surely, 256001857952 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 56001857952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77410317600).
56001857952 is an abundant number, since it is smaller than the sum of its proper divisors (98818777248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56001857952 is a wasteful number, since it uses less digits than its factorization.
56001857952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15638 (or 15630 counting only the distinct ones).
The product of its (nonzero) digits is 756000, while the sum is 48.
The spelling of 56001857952 in words is "fifty-six billion, one million, eight hundred fifty-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •