Base | Representation |
---|---|
bin | 10011100001111100010… |
… | …000010010100000001111 |
3 | 11202022020021002201210211 |
4 | 103201330100102200033 |
5 | 133442122244104411 |
6 | 2504320414143251 |
7 | 165651563344024 |
oct | 23417420224017 |
9 | 4668207081724 |
10 | 1342114441231 |
11 | 478207682223 |
12 | 19813b4b1b27 |
13 | 9973a252a55 |
14 | 48d5c8c154b |
15 | 24da1378221 |
hex | 1387c41280f |
1342114441231 has 2 divisors, whose sum is σ = 1342114441232. Its totient is φ = 1342114441230.
The previous prime is 1342114441201. The next prime is 1342114441273. The reversal of 1342114441231 is 1321444112431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1342114441231 - 219 = 1342113916943 is a prime.
It is a super-2 number, since 2×13421144412312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1342114441193 and 1342114441202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1342114441201) 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, 671057220615 + 671057220616.
It is an arithmetic number, because the mean of its divisors is an integer number (671057220616).
Almost surely, 21342114441231 is an apocalyptic number.
1342114441231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1342114441231 is an equidigital number, since it uses as much as digits as its factorization.
1342114441231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9216, while the sum is 31.
Adding to 1342114441231 its reverse (1321444112431), we get a palindrome (2663558553662).
The spelling of 1342114441231 in words is "one trillion, three hundred forty-two billion, one hundred fourteen million, four hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •