Base | Representation |
---|---|
bin | 10011100001111100010… |
… | …000010010111100010111 |
3 | 11202022020021002211021111 |
4 | 103201330100102330113 |
5 | 133442122244134111 |
6 | 2504320414155451 |
7 | 165651563352205 |
oct | 23417420227427 |
9 | 4668207084244 |
10 | 1342114443031 |
11 | 47820768360a |
12 | 19813b4b2b87 |
13 | 9973a25380b |
14 | 48d5c8c2075 |
15 | 24da1378a21 |
hex | 1387c412f17 |
1342114443031 has 2 divisors, whose sum is σ = 1342114443032. Its totient is φ = 1342114443030.
The previous prime is 1342114443011. The next prime is 1342114443053. The reversal of 1342114443031 is 1303444112431.
It is a weak prime.
It is an emirp because it is prime and its reverse (1303444112431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1342114443031 - 221 = 1342112345879 is a prime.
It is a super-2 number, since 2×13421144430312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1342114442984 and 1342114443002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1342114443011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671057221515 + 671057221516.
It is an arithmetic number, because the mean of its divisors is an integer number (671057221516).
Almost surely, 21342114443031 is an apocalyptic number.
1342114443031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1342114443031 is an equidigital number, since it uses as much as digits as its factorization.
1342114443031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 1342114443031 its reverse (1303444112431), we get a palindrome (2645558555462).
The spelling of 1342114443031 in words is "one trillion, three hundred forty-two billion, one hundred fourteen million, four hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •