Base | Representation |
---|---|
bin | 10011000100011110111… |
… | …011101100010001011101 |
3 | 11122021120212211022021011 |
4 | 103010132323230101131 |
5 | 132432332400131342 |
6 | 2442010015535221 |
7 | 163452005055616 |
oct | 23043673542135 |
9 | 4567525738234 |
10 | 1310483989597 |
11 | 465856058802 |
12 | 191b9252a511 |
13 | 96769152493 |
14 | 475dbad6c0d |
15 | 2414e537717 |
hex | 1311eeec45d |
1310483989597 has 2 divisors, whose sum is σ = 1310483989598. Its totient is φ = 1310483989596.
The previous prime is 1310483989579. The next prime is 1310483989603. The reversal of 1310483989597 is 7959893840131.
Together with previous prime (1310483989579) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 902691910201 + 407792079396 = 950101^2 + 638586^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1310483989597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310483989567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655241994798 + 655241994799.
It is an arithmetic number, because the mean of its divisors is an integer number (655241994799).
Almost surely, 21310483989597 is an apocalyptic number.
It is an amenable number.
1310483989597 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310483989597 is an equidigital number, since it uses as much as digits as its factorization.
1310483989597 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 58786560, while the sum is 67.
The spelling of 1310483989597 in words is "one trillion, three hundred ten billion, four hundred eighty-three million, nine hundred eighty-nine thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •