Base | Representation |
---|---|
bin | 10011000101010110010… |
… | …010001001100001000111 |
3 | 11122100222121012210101212 |
4 | 103011112102021201013 |
5 | 132441233112422211 |
6 | 2442242111442035 |
7 | 163514012243111 |
oct | 23052622114107 |
9 | 4570877183355 |
10 | 1311412623431 |
11 | 466192268089 |
12 | 1921b152631b |
13 | 96886663061 |
14 | 476891883b1 |
15 | 241a5d1d38b |
hex | 13156489847 |
1311412623431 has 2 divisors, whose sum is σ = 1311412623432. Its totient is φ = 1311412623430.
The previous prime is 1311412623407. The next prime is 1311412623457. The reversal of 1311412623431 is 1343262141131.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1311412623431 is a prime.
It is a super-2 number, since 2×13114126234312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311412626431) 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, 655706311715 + 655706311716.
It is an arithmetic number, because the mean of its divisors is an integer number (655706311716).
Almost surely, 21311412623431 is an apocalyptic number.
1311412623431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311412623431 is an equidigital number, since it uses as much as digits as its factorization.
1311412623431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 32.
Adding to 1311412623431 its reverse (1343262141131), we get a palindrome (2654674764562).
It can be divided in two parts, 131141 and 2623431, that added together give a palindrome (2754572).
The spelling of 1311412623431 in words is "one trillion, three hundred eleven billion, four hundred twelve million, six hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •