Base | Representation |
---|---|
bin | 10011000101000110001… |
… | …110000011001001110011 |
3 | 11122100021211002021001022 |
4 | 103011012032003021303 |
5 | 132440210114111311 |
6 | 2442155243130055 |
7 | 163504230402302 |
oct | 23050616031163 |
9 | 4570254067038 |
10 | 1311143113331 |
11 | 466064119167 |
12 | 19213721392b |
13 | 9684287c21c |
14 | 47661470439 |
15 | 2418c3335db |
hex | 13146383273 |
1311143113331 has 2 divisors, whose sum is σ = 1311143113332. Its totient is φ = 1311143113330.
The previous prime is 1311143113249. The next prime is 1311143113363. The reversal of 1311143113331 is 1333113411131.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1333113411131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1311143113331 - 226 = 1311076004467 is a prime.
It is a super-2 number, since 2×13111431133312 (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 1311143113331.
It is not a weakly prime, because it can be changed into another prime (1311143113531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655571556665 + 655571556666.
It is an arithmetic number, because the mean of its divisors is an integer number (655571556666).
Almost surely, 21311143113331 is an apocalyptic number.
1311143113331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311143113331 is an equidigital number, since it uses as much as digits as its factorization.
1311143113331 is an evil number, because the sum of its binary digits is even.
The product of its digits is 972, while the sum is 26.
Adding to 1311143113331 its reverse (1333113411131), we get a palindrome (2644256524462).
The spelling of 1311143113331 in words is "one trillion, three hundred eleven billion, one hundred forty-three million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •