Base | Representation |
---|---|
bin | 1101100010011… |
… | …0110100000000 |
3 | 10221211211101000 |
4 | 3120212310000 |
5 | 104014011310 |
6 | 5345012000 |
7 | 1256432265 |
oct | 330466400 |
9 | 127754330 |
10 | 56782080 |
11 | 2a063243 |
12 | 17024000 |
13 | b9c1384 |
14 | 778126c |
15 | 4eb94c0 |
hex | 3626d00 |
56782080 has 288 divisors, whose sum is σ = 211921920. Its totient is φ = 14376960.
The previous prime is 56782067. The next prime is 56782093. The reversal of 56782080 is 8028765.
It is an interprime number because it is at equal distance from previous prime (56782067) and next prime (56782093).
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1071334 + ... + 1071386.
It is an arithmetic number, because the mean of its divisors is an integer number (735840).
Almost surely, 256782080 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 56782080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105960960).
56782080 is an abundant number, since it is smaller than the sum of its proper divisors (155139840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56782080 is a wasteful number, since it uses less digits than its factorization.
56782080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114 (or 94 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 56782080 is about 7535.3885102229. The cubic root of 56782080 is about 384.3590391945.
The spelling of 56782080 in words is "fifty-six million, seven hundred eighty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •