Base | Representation |
---|---|
bin | 11011011100101… |
… | …101110001001011 |
3 | 1012002112110011021 |
4 | 123130231301023 |
5 | 1420342343311 |
6 | 113410213311 |
7 | 14261201356 |
oct | 3334556113 |
9 | 1162473137 |
10 | 460512331 |
11 | 216a46804 |
12 | 10a284237 |
13 | 7453a806 |
14 | 4523729d |
15 | 2a668171 |
hex | 1b72dc4b |
460512331 has 2 divisors, whose sum is σ = 460512332. Its totient is φ = 460512330.
The previous prime is 460512313. The next prime is 460512341. The reversal of 460512331 is 133215064.
Together with previous prime (460512313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 460512331 - 27 = 460512203 is a prime.
It is a super-2 number, since 2×4605123312 = 424143214006107122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 460512296 and 460512305.
It is not a weakly prime, because it can be changed into another prime (460512341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230256165 + 230256166.
It is an arithmetic number, because the mean of its divisors is an integer number (230256166).
Almost surely, 2460512331 is an apocalyptic number.
460512331 is a deficient number, since it is larger than the sum of its proper divisors (1).
460512331 is an equidigital number, since it uses as much as digits as its factorization.
460512331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 460512331 is about 21459.5510437660. The cubic root of 460512331 is about 772.2307442689.
Adding to 460512331 its reverse (133215064), we get a palindrome (593727395).
The spelling of 460512331 in words is "four hundred sixty million, five hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •