Base | Representation |
---|---|
bin | 11010101010001000… |
… | …00010001111110111 |
3 | 1100221102121002201002 |
4 | 31111010002033313 |
5 | 213302334214111 |
6 | 10324100153515 |
7 | 1014444121445 |
oct | 152504021767 |
9 | 40842532632 |
10 | 14312023031 |
11 | 6084844809 |
12 | 293509889b |
13 | 14711592a7 |
14 | 99aad9b95 |
15 | 58b71963b |
hex | 3551023f7 |
14312023031 has 2 divisors, whose sum is σ = 14312023032. Its totient is φ = 14312023030.
The previous prime is 14312023001. The next prime is 14312023039. The reversal of 14312023031 is 13032021341.
14312023031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14312023031 - 210 = 14312022007 is a prime.
It is a super-2 number, since 2×143120230312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14312022994 and 14312023012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14312023039) 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, 7156011515 + 7156011516.
It is an arithmetic number, because the mean of its divisors is an integer number (7156011516).
Almost surely, 214312023031 is an apocalyptic number.
14312023031 is a deficient number, since it is larger than the sum of its proper divisors (1).
14312023031 is an equidigital number, since it uses as much as digits as its factorization.
14312023031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 14312023031 its reverse (13032021341), we get a palindrome (27344044372).
The spelling of 14312023031 in words is "fourteen billion, three hundred twelve million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •