Base | Representation |
---|---|
bin | 11110100101011… |
… | …001100000000000 |
3 | 1022202112012122221 |
4 | 132211121200000 |
5 | 2022324322011 |
6 | 122525540424 |
7 | 15500310265 |
oct | 3645314000 |
9 | 1282465587 |
10 | 513120256 |
11 | 243708930 |
12 | 123a14714 |
13 | 823c9c6c |
14 | 4c20d26c |
15 | 300aa971 |
hex | 1e959800 |
513120256 has 48 divisors (see below), whose sum is σ = 1119310920. Its totient is φ = 233226240.
The previous prime is 513120253. The next prime is 513120263. The reversal of 513120256 is 652021315.
It is a self number, because there is not a number n which added to its sum of digits gives 513120256.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513120253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11140 + ... + 33916.
Almost surely, 2513120256 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 513120256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (559655460).
513120256 is an abundant number, since it is smaller than the sum of its proper divisors (606190664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
513120256 is a wasteful number, since it uses less digits than its factorization.
513120256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22810 (or 22790 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 513120256 is about 22652.1578663049. The cubic root of 513120256 is about 800.5830416415.
The spelling of 513120256 in words is "five hundred thirteen million, one hundred twenty thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •