Base | Representation |
---|---|
bin | 10101010011110011000… |
… | …101001011010110000001 |
3 | 12011222210021001100000011 |
4 | 111103303011023112001 |
5 | 142443010434220223 |
6 | 3040415421024521 |
7 | 210540244662364 |
oct | 25236305132601 |
9 | 5158707040004 |
10 | 1464367101313 |
11 | 515042064196 |
12 | 1b79796b5141 |
13 | a812104887c |
14 | 50c390920db |
15 | 28158e9d80d |
hex | 154f314b581 |
1464367101313 has 2 divisors, whose sum is σ = 1464367101314. Its totient is φ = 1464367101312.
The previous prime is 1464367101293. The next prime is 1464367101317. The reversal of 1464367101313 is 3131017634641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1464141140289 + 225961024 = 1210017^2 + 15032^2 .
It is a cyclic number.
It is not a de Polignac number, because 1464367101313 - 213 = 1464367093121 is a prime.
It is not a weakly prime, because it can be changed into another prime (1464367101317) 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, 732183550656 + 732183550657.
It is an arithmetic number, because the mean of its divisors is an integer number (732183550657).
Almost surely, 21464367101313 is an apocalyptic number.
It is an amenable number.
1464367101313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1464367101313 is an equidigital number, since it uses as much as digits as its factorization.
1464367101313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 1464367101313 in words is "one trillion, four hundred sixty-four billion, three hundred sixty-seven million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •