Base | Representation |
---|---|
bin | 11110101010110… |
… | …001110101001000 |
3 | 1022212011212100002 |
4 | 132222301311020 |
5 | 2023204440012 |
6 | 123020102132 |
7 | 15515303210 |
oct | 3652616510 |
9 | 1285155302 |
10 | 514530632 |
11 | 244491530 |
12 | 124394948 |
13 | 827a1bc5 |
14 | 4c499240 |
15 | 302887c2 |
hex | 1eab1d48 |
514530632 has 64 divisors (see below), whose sum is σ = 1205591040. Its totient is φ = 200001600.
The previous prime is 514530593. The next prime is 514530641. The reversal of 514530632 is 236035415.
It is a junction number, because it is equal to n+sod(n) for n = 514530595 and 514530604.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 397907 + ... + 399197.
It is an arithmetic number, because the mean of its divisors is an integer number (18837360).
Almost surely, 2514530632 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 514530632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (602795520).
514530632 is an abundant number, since it is smaller than the sum of its proper divisors (691060408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
514530632 is a wasteful number, since it uses less digits than its factorization.
514530632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1962 (or 1958 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 514530632 is about 22683.2676658369. The cubic root of 514530632 is about 801.3158719147.
The spelling of 514530632 in words is "five hundred fourteen million, five hundred thirty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •