Base | Representation |
---|---|
bin | 111010011000011111001… |
… | …101001110010000011111 |
3 | 112012112201210010010010221 |
4 | 322120133031032100133 |
5 | 1011213110342430211 |
6 | 12311033052542211 |
7 | 562600445642245 |
oct | 72303715162037 |
9 | 15175653103127 |
10 | 4012023014431 |
11 | 1307542442333 |
12 | 549682481967 |
13 | 23144195a763 |
14 | dc27c02c795 |
15 | 6e566774c71 |
hex | 3a61f34e41f |
4012023014431 has 2 divisors, whose sum is σ = 4012023014432. Its totient is φ = 4012023014430.
The previous prime is 4012023014401. The next prime is 4012023014453. The reversal of 4012023014431 is 1344103202104.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4012023014431 - 29 = 4012023013919 is a prime.
It is a super-2 number, since 2×40120230144312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4012023014396 and 4012023014405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4012023014401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2006011507215 + 2006011507216.
It is an arithmetic number, because the mean of its divisors is an integer number (2006011507216).
Almost surely, 24012023014431 is an apocalyptic number.
4012023014431 is a deficient number, since it is larger than the sum of its proper divisors (1).
4012023014431 is an equidigital number, since it uses as much as digits as its factorization.
4012023014431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4012023014431 its reverse (1344103202104), we get a palindrome (5356126216535).
The spelling of 4012023014431 in words is "four trillion, twelve billion, twenty-three million, fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •