Base | Representation |
---|---|
bin | 11110001100101… |
… | …101111000000000 |
3 | 1022022100111021222 |
4 | 132030231320000 |
5 | 2014200300422 |
6 | 122135134212 |
7 | 15361312013 |
oct | 3614557000 |
9 | 1268314258 |
10 | 506650112 |
11 | 23aa99801 |
12 | 121814368 |
13 | 80c72c87 |
14 | 4b40737a |
15 | 2e72d842 |
hex | 1e32de00 |
506650112 has 80 divisors (see below), whose sum is σ = 1057110912. Its totient is φ = 242319360.
The previous prime is 506650103. The next prime is 506650121. The reversal of 506650112 is 211056605.
It is an interprime number because it is at equal distance from previous prime (506650103) and next prime (506650121).
It is a super-2 number, since 2×5066501122 = 513388671979225088, which contains 22 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 2174348 + ... + 2174580.
Almost surely, 2506650112 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 506650112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (528555456).
506650112 is an abundant number, since it is smaller than the sum of its proper divisors (550460800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506650112 is a wasteful number, since it uses less digits than its factorization.
506650112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419 (or 403 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 506650112 is about 22508.8896216584. The cubic root of 506650112 is about 797.2038382356.
The spelling of 506650112 in words is "five hundred six million, six hundred fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •