Base | Representation |
---|---|
bin | 11001101100011010001011… |
… | …00011111111010000000000 |
3 | 21102001111011000121202000000 |
4 | 30312031011203333100000 |
5 | 24401204443212402041 |
6 | 320100225132000000 |
7 | 14621044616306532 |
oct | 1466150543772000 |
9 | 242044130552000 |
10 | 56501461840896 |
11 | 17004154245706 |
12 | 6406441300000 |
13 | 256b0aca22147 |
14 | dd4984829852 |
15 | 67eaecc38bb6 |
hex | 3363458ff400 |
56501461840896 has 616 divisors, whose sum is σ = 174444917237184. Its totient is φ = 18272430489600.
The previous prime is 56501461840891. The next prime is 56501461840903. The reversal of 56501461840896 is 69804816410565.
56501461840896 is a `hidden beast` number, since 5 + 6 + 5 + 0 + 1 + 4 + 618 + 4 + 0 + 8 + 9 + 6 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56501461840891) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 4846992700 + ... + 4847004356.
Almost surely, 256501461840896 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 56501461840896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87222458618592).
56501461840896 is an abundant number, since it is smaller than the sum of its proper divisors (117943455396288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56501461840896 is a wasteful number, since it uses less digits than its factorization.
56501461840896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11889 (or 11856 counting only the distinct ones).
The product of its (nonzero) digits is 49766400, while the sum is 63.
The spelling of 56501461840896 in words is "fifty-six trillion, five hundred one billion, four hundred sixty-one million, eight hundred forty thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •