Base | Representation |
---|---|
bin | 11010001000110011… |
… | …00000101011011111 |
3 | 1100012221111210221011 |
4 | 31010121200223133 |
5 | 212214301040111 |
6 | 10240231520051 |
7 | 1004510525611 |
oct | 150431405337 |
9 | 40187453834 |
10 | 14032440031 |
11 | 5a50a45985 |
12 | 2877529027 |
13 | 142825966c |
14 | 97191cdb1 |
15 | 571de0021 |
hex | 344660adf |
14032440031 has 2 divisors, whose sum is σ = 14032440032. Its totient is φ = 14032440030.
The previous prime is 14032439969. The next prime is 14032440073. The reversal of 14032440031 is 13004423041.
14032440031 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 14032440031 - 219 = 14031915743 is a prime.
It is a super-2 number, since 2×140324400312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14032439984 and 14032440011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14039440031) 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, 7016220015 + 7016220016.
It is an arithmetic number, because the mean of its divisors is an integer number (7016220016).
Almost surely, 214032440031 is an apocalyptic number.
14032440031 is a deficient number, since it is larger than the sum of its proper divisors (1).
14032440031 is an equidigital number, since it uses as much as digits as its factorization.
14032440031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 14032440031 its reverse (13004423041), we get a palindrome (27036863072).
The spelling of 14032440031 in words is "fourteen billion, thirty-two million, four hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •