Base | Representation |
---|---|
bin | 1100010011110… |
… | …1100110110000 |
3 | 10121011012120001 |
4 | 3010331212300 |
5 | 101204220220 |
6 | 5042355344 |
7 | 1164604150 |
oct | 304754660 |
9 | 117135501 |
10 | 51632560 |
11 | 27166341 |
12 | 1535bb54 |
13 | a90a515 |
14 | 6c00760 |
15 | 47ed80a |
hex | 313d9b0 |
51632560 has 80 divisors (see below), whose sum is σ = 138401856. Its totient is φ = 17547264.
The previous prime is 51632543. The next prime is 51632573. The reversal of 51632560 is 6523615.
51632560 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (28).
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 15 ways as a sum of consecutive naturals, for example, 76384 + ... + 77056.
Almost surely, 251632560 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 51632560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69200928).
51632560 is an abundant number, since it is smaller than the sum of its proper divisors (86769296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51632560 is a wasteful number, since it uses less digits than its factorization.
51632560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830 (or 824 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 51632560 is about 7185.5800044255. The cubic root of 51632560 is about 372.3698868425.
The spelling of 51632560 in words is "fifty-one million, six hundred thirty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •