Base | Representation |
---|---|
bin | 1100110001010… |
… | …1101010110000 |
3 | 10201210102220200 |
4 | 3030111222300 |
5 | 102203104003 |
6 | 5152035200 |
7 | 1220206320 |
oct | 314255260 |
9 | 121712820 |
10 | 53566128 |
11 | 28267030 |
12 | 15b32b00 |
13 | b136645 |
14 | 7185280 |
15 | 4a816a3 |
hex | 3315ab0 |
53566128 has 120 divisors (see below), whose sum is σ = 186940416. Its totient is φ = 13910400.
The previous prime is 53566067. The next prime is 53566129. The reversal of 53566128 is 82166535.
53566128 is a `hidden beast` number, since 5 + 35 + 6 + 612 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 53566092 and 53566101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53566129) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8673 + ... + 13503.
Almost surely, 253566128 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 53566128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93470208).
53566128 is an abundant number, since it is smaller than the sum of its proper divisors (133374288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53566128 is a wasteful number, since it uses less digits than its factorization.
53566128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4863 (or 4854 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
The square root of 53566128 is about 7318.8884401936. Note that the first 3 decimals coincide. The cubic root of 53566128 is about 376.9612870586.
The spelling of 53566128 in words is "fifty-three million, five hundred sixty-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •