Base | Representation |
---|---|
bin | 11101110101001… |
… | …101111110010011 |
3 | 1021212202112101112 |
4 | 131311031332103 |
5 | 2011111141011 |
6 | 121355123535 |
7 | 15255044621 |
oct | 3565157623 |
9 | 1255675345 |
10 | 500490131 |
11 | 237571709 |
12 | 11b7435ab |
13 | 7c8c720b |
14 | 4a682511 |
15 | 2de1358b |
hex | 1dd4df93 |
500490131 has 2 divisors, whose sum is σ = 500490132. Its totient is φ = 500490130.
The previous prime is 500490121. The next prime is 500490161. The reversal of 500490131 is 131094005.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 500490131 - 210 = 500489107 is a prime.
It is a super-2 number, since 2×5004901312 = 500980742456794322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 500490097 and 500490106.
It is not a weakly prime, because it can be changed into another prime (500490121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250245065 + 250245066.
It is an arithmetic number, because the mean of its divisors is an integer number (250245066).
Almost surely, 2500490131 is an apocalyptic number.
500490131 is a deficient number, since it is larger than the sum of its proper divisors (1).
500490131 is an equidigital number, since it uses as much as digits as its factorization.
500490131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
The square root of 500490131 is about 22371.6367528172. The cubic root of 500490131 is about 793.9597861099.
The spelling of 500490131 in words is "five hundred million, four hundred ninety thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •