Base | Representation |
---|---|
bin | 10011000110000000000… |
… | …001111111100010100011 |
3 | 11122102210102011012102012 |
4 | 103012000001333202203 |
5 | 132444201414000311 |
6 | 2442435411543135 |
7 | 163540245513464 |
oct | 23060001774243 |
9 | 4572712135365 |
10 | 1312113031331 |
11 | 466511665993 |
12 | 192367bbaaab |
13 | 969687b5cbb |
14 | 477141cad6b |
15 | 241e757178b |
hex | 1318007f8a3 |
1312113031331 has 2 divisors, whose sum is σ = 1312113031332. Its totient is φ = 1312113031330.
The previous prime is 1312113031309. The next prime is 1312113031393. The reversal of 1312113031331 is 1331303112131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1312113031331 - 234 = 1294933162147 is a prime.
It is a super-2 number, since 2×13121130313312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1312113031297 and 1312113031306.
It is not a weakly prime, because it can be changed into another prime (1312113031531) 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, 656056515665 + 656056515666.
It is an arithmetic number, because the mean of its divisors is an integer number (656056515666).
Almost surely, 21312113031331 is an apocalyptic number.
1312113031331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312113031331 is an equidigital number, since it uses as much as digits as its factorization.
1312113031331 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 1312113031331 its reverse (1331303112131), we get a palindrome (2643416143462).
The spelling of 1312113031331 in words is "one trillion, three hundred twelve billion, one hundred thirteen million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •