Base | Representation |
---|---|
bin | 11110001100100… |
… | …010101001100100 |
3 | 1022022021011020000 |
4 | 132030202221210 |
5 | 2014142313012 |
6 | 122134141300 |
7 | 15361030656 |
oct | 3614425144 |
9 | 1268234200 |
10 | 506604132 |
11 | 23aa68201 |
12 | 1217b1830 |
13 | 80c58078 |
14 | 4b3d46d6 |
15 | 2e71eddc |
hex | 1e322a64 |
506604132 has 60 divisors (see below), whose sum is σ = 1370056380. Its totient is φ = 163041984.
The previous prime is 506604107. The next prime is 506604167. The reversal of 506604132 is 231406605.
506604132 is a `hidden beast` number, since 50 + 6 + 604 + 1 + 3 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 137733696 + 368870436 = 11736^2 + 19206^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 506604096 and 506604105.
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 19 ways as a sum of consecutive naturals, for example, 17563 + ... + 36354.
It is an arithmetic number, because the mean of its divisors is an integer number (22834273).
Almost surely, 2506604132 is an apocalyptic number.
It is an amenable number.
506604132 is an abundant number, since it is smaller than the sum of its proper divisors (863452248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506604132 is a wasteful number, since it uses less digits than its factorization.
506604132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53962 (or 53951 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 506604132 is about 22507.8682242455. The cubic root of 506604132 is about 797.1797213020.
The spelling of 506604132 in words is "five hundred six million, six hundred four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •