Base | Representation |
---|---|
bin | 10100100100111011100… |
… | …010010111011101101011 |
3 | 12000011220002120110011201 |
4 | 110210323202113131223 |
5 | 141131430013331011 |
6 | 3001334043105031 |
7 | 204106210035346 |
oct | 24447342273553 |
9 | 5004802513151 |
10 | 1414043105131 |
11 | 4a5768517aa8 |
12 | 1aa074212177 |
13 | a3461128a37 |
14 | 4c62370345d |
15 | 26bb0e59cc1 |
hex | 1493b89776b |
1414043105131 has 2 divisors, whose sum is σ = 1414043105132. Its totient is φ = 1414043105130.
The previous prime is 1414043105047. The next prime is 1414043105141. The reversal of 1414043105131 is 1315013404141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1414043105131 - 221 = 1414041007979 is a prime.
It is a super-2 number, since 2×14140431051312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1414043105131.
It is not a weakly prime, because it can be changed into another prime (1414043105141) 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, 707021552565 + 707021552566.
It is an arithmetic number, because the mean of its divisors is an integer number (707021552566).
Almost surely, 21414043105131 is an apocalyptic number.
1414043105131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1414043105131 is an equidigital number, since it uses as much as digits as its factorization.
1414043105131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 1414043105131 its reverse (1315013404141), we get a palindrome (2729056509272).
The spelling of 1414043105131 in words is "one trillion, four hundred fourteen billion, forty-three million, one hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •