Base | Representation |
---|---|
bin | 11000010000010… |
… | …000100010011111 |
3 | 1001100200102202111 |
4 | 120100100202133 |
5 | 1313132241411 |
6 | 104213334451 |
7 | 13040502532 |
oct | 3020204237 |
9 | 1040612674 |
10 | 406915231 |
11 | 199769488 |
12 | b4337427 |
13 | 663c3058 |
14 | 3c084a19 |
15 | 25acc721 |
hex | 1841089f |
406915231 has 2 divisors, whose sum is σ = 406915232. Its totient is φ = 406915230.
The previous prime is 406915193. The next prime is 406915259. The reversal of 406915231 is 132519604.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 406915231 - 211 = 406913183 is a prime.
It is a super-3 number, since 3×4069152313 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 406915193 and 406915202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401915231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203457615 + 203457616.
It is an arithmetic number, because the mean of its divisors is an integer number (203457616).
Almost surely, 2406915231 is an apocalyptic number.
406915231 is a deficient number, since it is larger than the sum of its proper divisors (1).
406915231 is an equidigital number, since it uses as much as digits as its factorization.
406915231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 406915231 is about 20172.1399707617. The cubic root of 406915231 is about 741.0280518725.
The spelling of 406915231 in words is "four hundred six million, nine hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •