Base | Representation |
---|---|
bin | 10011000100000010101… |
… | …100110000011001111001 |
3 | 11122020100212112000012001 |
4 | 103010002230300121321 |
5 | 132430400114443223 |
6 | 2441451015221001 |
7 | 163434163633363 |
oct | 23040254603171 |
9 | 4566325460161 |
10 | 1310010312313 |
11 | 46563273aa7a |
12 | 191a7b977761 |
13 | 966c1c85671 |
14 | 47594c33d33 |
15 | 24122b6d9ad |
hex | 13102b30679 |
1310010312313 has 2 divisors, whose sum is σ = 1310010312314. Its totient is φ = 1310010312312.
The previous prime is 1310010312187. The next prime is 1310010312437. The reversal of 1310010312313 is 3132130100131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1306204409449 + 3805902864 = 1142893^2 + 61692^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310010312313 - 217 = 1310010181241 is a prime.
It is a super-2 number, since 2×13100103123132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1310010312113) 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, 655005156156 + 655005156157.
It is an arithmetic number, because the mean of its divisors is an integer number (655005156157).
Almost surely, 21310010312313 is an apocalyptic number.
It is an amenable number.
1310010312313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310010312313 is an equidigital number, since it uses as much as digits as its factorization.
1310010312313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1310010312313 its reverse (3132130100131), we get a palindrome (4442140412444).
The spelling of 1310010312313 in words is "one trillion, three hundred ten billion, ten million, three hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •