Base | Representation |
---|---|
bin | 11110000110011… |
… | …010001110010000 |
3 | 1022012020111022102 |
4 | 132012122032100 |
5 | 2013234344002 |
6 | 122035455532 |
7 | 15341254511 |
oct | 3606321620 |
9 | 1265214272 |
10 | 504996752 |
11 | 23a06a597 |
12 | 1211575a8 |
13 | 80814560 |
14 | 4b0d6a08 |
15 | 2e503a02 |
hex | 1e19a390 |
504996752 has 20 divisors (see below), whose sum is σ = 1053695580. Its totient is φ = 233075328.
The previous prime is 504996733. The next prime is 504996787. The reversal of 504996752 is 257699405.
It can be written as a sum of positive squares in 2 ways, for example, as 120209296 + 384787456 = 10964^2 + 19616^2 .
It is a junction number, because it is equal to n+sod(n) for n = 504996697 and 504996706.
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 3 ways as a sum of consecutive naturals, for example, 1213727 + ... + 1214142.
It is an arithmetic number, because the mean of its divisors is an integer number (52684779).
Almost surely, 2504996752 is an apocalyptic number.
504996752 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
504996752 is an abundant number, since it is smaller than the sum of its proper divisors (548698828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
504996752 is a wasteful number, since it uses less digits than its factorization.
504996752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2427890 (or 2427884 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 47.
The square root of 504996752 is about 22472.1327870765. The cubic root of 504996752 is about 796.3357169119.
The spelling of 504996752 in words is "five hundred four million, nine hundred ninety-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •