Base | Representation |
---|---|
bin | 11001110101100110100111… |
… | …11011110101000000000000 |
3 | 21110011200121010010212222000 |
4 | 30322303103323311000000 |
5 | 24421344000031131043 |
6 | 320501313452144000 |
7 | 14652630501366000 |
oct | 1472632373650000 |
9 | 243150533125860 |
10 | 56817383067648 |
11 | 17116131574245 |
12 | 645770a768000 |
13 | 2591b191b6088 |
14 | 1005d94276000 |
15 | 687e3d02d2d3 |
hex | 33acd3ef5000 |
56817383067648 has 1664 divisors, whose sum is σ = 203818291200000. Its totient is φ = 15624604090368.
The previous prime is 56817383067631. The next prime is 56817383067713. The reversal of 56817383067648 is 84676038371865.
56817383067648 is a `hidden beast` number, since 56 + 81 + 7 + 383 + 0 + 67 + 64 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 118616665873 + ... + 118616666351.
Almost surely, 256817383067648 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 56817383067648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101909145600000).
56817383067648 is an abundant number, since it is smaller than the sum of its proper divisors (147000908132352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56817383067648 is an equidigital number, since it uses as much as digits as its factorization.
56817383067648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645 (or 603 counting only the distinct ones).
The product of its (nonzero) digits is 975421440, while the sum is 72.
The spelling of 56817383067648 in words is "fifty-six trillion, eight hundred seventeen billion, three hundred eighty-three million, sixty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •