Base | Representation |
---|---|
bin | 11110001010011… |
… | …111000100000000 |
3 | 1022021020202212210 |
4 | 132022133010000 |
5 | 2014023041102 |
6 | 122114422120 |
7 | 15353324415 |
oct | 3612370400 |
9 | 1267222783 |
10 | 506065152 |
11 | 23a72a26a |
12 | 121591940 |
13 | 80ac9948 |
14 | 4b2d410c |
15 | 2e66536c |
hex | 1e29f100 |
506065152 has 144 divisors (see below), whose sum is σ = 1438976000. Its totient is φ = 157427712.
The previous prime is 506065123. The next prime is 506065181. The reversal of 506065152 is 251560605.
It is an interprime number because it is at equal distance from previous prime (506065123) and next prime (506065181).
It is a super-2 number, since 2×5060651522 = 512203876137566208, which contains 22 as substring.
It is a congruent number.
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, 1152549 + ... + 1152987.
Almost surely, 2506065152 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 506065152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (719488000).
506065152 is an abundant number, since it is smaller than the sum of its proper divisors (932910848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506065152 is a wasteful number, since it uses less digits than its factorization.
506065152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 556 (or 542 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 506065152 is about 22495.8918916321. The cubic root of 506065152 is about 796.8969124555.
The spelling of 506065152 in words is "five hundred six million, sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •