Base | Representation |
---|---|
bin | 11110001101010… |
… | …000111101110000 |
3 | 1022022121210110020 |
4 | 132031100331300 |
5 | 2014214400330 |
6 | 122142203440 |
7 | 15362451030 |
oct | 3615207560 |
9 | 1268553406 |
10 | 506793840 |
11 | 240087793 |
12 | 121883580 |
13 | 80cc3517 |
14 | 4b4438c0 |
15 | 2e75b210 |
hex | 1e350f70 |
506793840 has 160 divisors (see below), whose sum is σ = 1890117120. Its totient is φ = 109734912.
The previous prime is 506793827. The next prime is 506793869. The reversal of 506793840 is 48397605.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 506793792 and 506793801.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23982 + ... + 39858.
It is an arithmetic number, because the mean of its divisors is an integer number (11813232).
Almost surely, 2506793840 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 506793840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (945058560).
506793840 is an abundant number, since it is smaller than the sum of its proper divisors (1383323280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506793840 is a wasteful number, since it uses less digits than its factorization.
506793840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15919 (or 15913 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The square root of 506793840 is about 22512.0820894026. The cubic root of 506793840 is about 797.2792154880.
The spelling of 506793840 in words is "five hundred six million, seven hundred ninety-three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •