Base | Representation |
---|---|
bin | 10111010010000… |
… | …101000001011011 |
3 | 1000020000022020002 |
4 | 113102011001123 |
5 | 1244444141011 |
6 | 102432123215 |
7 | 12452113424 |
oct | 2722050133 |
9 | 1006008202 |
10 | 390615131 |
11 | 190545a25 |
12 | aa99650b |
13 | 62c06a1a |
14 | 39c4064b |
15 | 2445cc3b |
hex | 1748505b |
390615131 has 2 divisors, whose sum is σ = 390615132. Its totient is φ = 390615130.
The previous prime is 390615107. The next prime is 390615259. The reversal of 390615131 is 131516093.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-390615131 is a prime.
It is a super-2 number, since 2×3906151312 = 305160361132294322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 390615094 and 390615103.
It is not a weakly prime, because it can be changed into another prime (390615431) by changing a digit.
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 as a sum of consecutive naturals, namely, 195307565 + 195307566.
It is an arithmetic number, because the mean of its divisors is an integer number (195307566).
Almost surely, 2390615131 is an apocalyptic number.
390615131 is a deficient number, since it is larger than the sum of its proper divisors (1).
390615131 is an equidigital number, since it uses as much as digits as its factorization.
390615131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 29.
The square root of 390615131 is about 19763.9857063296. The cubic root of 390615131 is about 730.9982783134.
The spelling of 390615131 in words is "three hundred ninety million, six hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •