Base | Representation |
---|---|
bin | 111001100011111110000110… |
… | …1010000111010111101001001 |
3 | 2110101201211002021202210222020 |
4 | 1303013330031100322331021 |
5 | 1012331030433213210040 |
6 | 4552504400542115053 |
7 | 211435326116014353 |
oct | 16307741520727511 |
9 | 2411654067683866 |
10 | 506321032163145 |
11 | 1373695a8991a31 |
12 | 489544a927ba89 |
13 | 18969b3a018924 |
14 | 8d060d67940d3 |
15 | 3d8088a6e6cd0 |
hex | 1cc7f0d43af49 |
506321032163145 has 32 divisors (see below), whose sum is σ = 810566555765760. Its totient is φ = 269886933919680.
The previous prime is 506321032163143. The next prime is 506321032163179. The reversal of 506321032163145 is 541361230123605.
It is a happy number.
It is not a de Polignac number, because 506321032163145 - 21 = 506321032163143 is a prime.
It is a super-2 number, since 2×5063210321631452 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 506321032163097 and 506321032163106.
It is not an unprimeable number, because it can be changed into a prime (506321032163143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 451210662 + ... + 452331408.
It is an arithmetic number, because the mean of its divisors is an integer number (25330204867680).
Almost surely, 2506321032163145 is an apocalyptic number.
It is an amenable number.
506321032163145 is a deficient number, since it is larger than the sum of its proper divisors (304245523602615).
506321032163145 is a wasteful number, since it uses less digits than its factorization.
506321032163145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137565.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 506321032163145 in words is "five hundred six trillion, three hundred twenty-one billion, thirty-two million, one hundred sixty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •