Base | Representation |
---|---|
bin | 10011000101001111110… |
… | …000110001100101000011 |
3 | 11122100200222100002012212 |
4 | 103011033300301211003 |
5 | 132441022110230311 |
6 | 2442223202412335 |
7 | 163511213250311 |
oct | 23051760614503 |
9 | 4570628302185 |
10 | 1311303211331 |
11 | 466136528163 |
12 | 1921809610ab |
13 | 96869aa5479 |
14 | 476788270b1 |
15 | 2419b409c8b |
hex | 1314fc31943 |
1311303211331 has 2 divisors, whose sum is σ = 1311303211332. Its totient is φ = 1311303211330.
The previous prime is 1311303211243. The next prime is 1311303211373. The reversal of 1311303211331 is 1331123031131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1311303211331 - 222 = 1311299017027 is a prime.
It is a super-2 number, since 2×13113032113312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1311303211297 and 1311303211306.
It is not a weakly prime, because it can be changed into another prime (1311303211831) 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, 655651605665 + 655651605666.
It is an arithmetic number, because the mean of its divisors is an integer number (655651605666).
Almost surely, 21311303211331 is an apocalyptic number.
1311303211331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311303211331 is an equidigital number, since it uses as much as digits as its factorization.
1311303211331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1311303211331 its reverse (1331123031131), we get a palindrome (2642426242462).
The spelling of 1311303211331 in words is "one trillion, three hundred eleven billion, three hundred three million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •