Base | Representation |
---|---|
bin | 1110010101001001111011… |
… | …10100000011001001100001 |
3 | 11010120122002221020101110111 |
4 | 13022210331310003021201 |
5 | 13112303024244332223 |
6 | 151004545250131321 |
7 | 6431516526145231 |
oct | 712447564031141 |
9 | 133518087211414 |
10 | 31513212105313 |
11 | a04a75075a744 |
12 | 364b57ab80b41 |
13 | 14778b5b5c743 |
14 | 7ad3675d5cc1 |
15 | 399ae702130d |
hex | 1ca93dd03261 |
31513212105313 has 2 divisors, whose sum is σ = 31513212105314. Its totient is φ = 31513212105312.
The previous prime is 31513212105283. The next prime is 31513212105317. The reversal of 31513212105313 is 31350121231513.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17811539818384 + 13701672286929 = 4220372^2 + 3701577^2 .
It is a cyclic number.
It is not a de Polignac number, because 31513212105313 - 225 = 31513178550881 is a prime.
It is not a weakly prime, because it can be changed into another prime (31513212105317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15756606052656 + 15756606052657.
It is an arithmetic number, because the mean of its divisors is an integer number (15756606052657).
Almost surely, 231513212105313 is an apocalyptic number.
It is an amenable number.
31513212105313 is a deficient number, since it is larger than the sum of its proper divisors (1).
31513212105313 is an equidigital number, since it uses as much as digits as its factorization.
31513212105313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 31513212105313 its reverse (31350121231513), we get a palindrome (62863333336826).
The spelling of 31513212105313 in words is "thirty-one trillion, five hundred thirteen billion, two hundred twelve million, one hundred five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •