Base | Representation |
---|---|
bin | 1101011100010… |
… | …1010001101010 |
3 | 10221002112100100 |
4 | 3113011101222 |
5 | 103413220240 |
6 | 5332250230 |
7 | 1253146446 |
oct | 327052152 |
9 | 127075310 |
10 | 56382570 |
11 | 29910072 |
12 | 16a70976 |
13 | b8b158a |
14 | 76b9826 |
15 | 4e3ae30 |
hex | 35c546a |
56382570 has 48 divisors (see below), whose sum is σ = 147682080. Its totient is φ = 14923872.
The previous prime is 56382569. The next prime is 56382587. The reversal of 56382570 is 7528365.
56382570 is a `hidden beast` number, since 5 + 6 + 3 + 82 + 570 = 666.
56382570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10257 + ... + 14763.
It is an arithmetic number, because the mean of its divisors is an integer number (3076710).
Almost surely, 256382570 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56382570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73841040).
56382570 is an abundant number, since it is smaller than the sum of its proper divisors (91299510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56382570 is a wasteful number, since it uses less digits than its factorization.
56382570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4659 (or 4656 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 56382570 is about 7508.8327987777. The cubic root of 56382570 is about 383.4554863804.
The spelling of 56382570 in words is "fifty-six million, three hundred eighty-two thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •