Base | Representation |
---|---|
bin | 110100001010000010… |
… | …110010001100000000 |
3 | 12100112221200001222000 |
4 | 310022002302030000 |
5 | 1404143241424424 |
6 | 41421044144000 |
7 | 4021544204400 |
oct | 641202621400 |
9 | 170487601860 |
10 | 56003076864 |
11 | 218293055a9 |
12 | aa2b398000 |
13 | 5386675107 |
14 | 29d3b00800 |
15 | 16cb8d93c9 |
hex | d0a0b2300 |
56003076864 has 864 divisors, whose sum is σ = 204541444800. Its totient is φ = 15049359360.
The previous prime is 56003076851. The next prime is 56003076953. The reversal of 56003076864 is 46867030065.
56003076864 is a `hidden beast` number, since 5 + 600 + 30 + 7 + 6 + 8 + 6 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (864).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 513789642 + ... + 513789750.
Almost surely, 256003076864 is an apocalyptic number.
56003076864 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56003076864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102270722400).
56003076864 is an abundant number, since it is smaller than the sum of its proper divisors (148538367936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56003076864 is a wasteful number, since it uses less digits than its factorization.
56003076864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226 (or 199 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 56003076864 in words is "fifty-six billion, three million, seventy-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •