Base | Representation |
---|---|
bin | 1011110100010100000… |
… | …11100101110101001111 |
3 | 1102211001211202211100001 |
4 | 11322022003211311033 |
5 | 23123034014414043 |
6 | 510311133145131 |
7 | 41223061412326 |
oct | 5721203456517 |
9 | 1384054684301 |
10 | 406043123023 |
11 | 14722483714a |
12 | 6683b02b1a7 |
13 | 2c39c625295 |
14 | 1591c9d90bd |
15 | a8671ed74d |
hex | 5e8a0e5d4f |
406043123023 has 2 divisors, whose sum is σ = 406043123024. Its totient is φ = 406043123022.
The previous prime is 406043122999. The next prime is 406043123051. The reversal of 406043123023 is 320321340604.
It is an a-pointer prime, because the next prime (406043123051) can be obtained adding 406043123023 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-406043123023 is a prime.
It is a super-2 number, since 2×4060431230232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 406043122982 and 406043123000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (406043123093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203021561511 + 203021561512.
It is an arithmetic number, because the mean of its divisors is an integer number (203021561512).
Almost surely, 2406043123023 is an apocalyptic number.
406043123023 is a deficient number, since it is larger than the sum of its proper divisors (1).
406043123023 is an equidigital number, since it uses as much as digits as its factorization.
406043123023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 406043123023 its reverse (320321340604), we get a palindrome (726364463627).
The spelling of 406043123023 in words is "four hundred six billion, forty-three million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •