Base | Representation |
---|---|
bin | 10011000110000111000… |
… | …111110100110111110101 |
3 | 11122110002201000111010201 |
4 | 103012013013310313311 |
5 | 132444422343013023 |
6 | 2442455301520501 |
7 | 163543221654043 |
oct | 23060707646765 |
9 | 4573081014121 |
10 | 1312232001013 |
11 | 46657283363a |
12 | 19239ba13131 |
13 | 9698733bc6b |
14 | 47725d19393 |
15 | 24202c21bad |
hex | 131871f4df5 |
1312232001013 has 2 divisors, whose sum is σ = 1312232001014. Its totient is φ = 1312232001012.
The previous prime is 1312232001011. The next prime is 1312232001071. The reversal of 1312232001013 is 3101002322131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 662429954404 + 649802046609 = 813898^2 + 806103^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312232001013 - 21 = 1312232001011 is a prime.
Together with 1312232001011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312232001011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656116000506 + 656116000507.
It is an arithmetic number, because the mean of its divisors is an integer number (656116000507).
Almost surely, 21312232001013 is an apocalyptic number.
It is an amenable number.
1312232001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312232001013 is an equidigital number, since it uses as much as digits as its factorization.
1312232001013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1312232001013 its reverse (3101002322131), we get a palindrome (4413234323144).
The spelling of 1312232001013 in words is "one trillion, three hundred twelve billion, two hundred thirty-two million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •