Base | Representation |
---|---|
bin | 10100100001001011001… |
… | …001101101100001001111 |
3 | 11222210111000210001221211 |
4 | 110201023021231201033 |
5 | 141100200042010111 |
6 | 2555425534035251 |
7 | 203604236120215 |
oct | 24411311554117 |
9 | 4883430701854 |
10 | 1410010110031 |
11 | 4a3a88a480a6 |
12 | 1a9329648b27 |
13 | a2c6a723cc3 |
14 | 4c35dc40cb5 |
15 | 26a26d68521 |
hex | 1484b26d84f |
1410010110031 has 2 divisors, whose sum is σ = 1410010110032. Its totient is φ = 1410010110030.
The previous prime is 1410010110023. The next prime is 1410010110059. The reversal of 1410010110031 is 1300110100141.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1410010110031 - 23 = 1410010110023 is a prime.
It is a super-2 number, since 2×14100101100312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1410010109993 and 1410010110020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1410010110011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705005055015 + 705005055016.
It is an arithmetic number, because the mean of its divisors is an integer number (705005055016).
Almost surely, 21410010110031 is an apocalyptic number.
1410010110031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1410010110031 is an equidigital number, since it uses as much as digits as its factorization.
1410010110031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1410010110031 its reverse (1300110100141), we get a palindrome (2710120210172).
The spelling of 1410010110031 in words is "one trillion, four hundred ten billion, ten million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •