Base | Representation |
---|---|
bin | 1110000110100001001101… |
… | …01001001010010001110011 |
3 | 11001210120000222100021210210 |
4 | 13003100212221022101303 |
5 | 13031033104410420311 |
6 | 145541535111555203 |
7 | 6350264305405161 |
oct | 703204651122163 |
9 | 131716028307723 |
10 | 31010312201331 |
11 | 9976443889491 |
12 | 358a00a98bb03 |
13 | 143c34bca5868 |
14 | 792c9b1c4231 |
15 | 38b9b1a1c3a6 |
hex | 1c3426a4a473 |
31010312201331 has 16 divisors (see below), whose sum is σ = 43779383946144. Its totient is φ = 19457397609984.
The previous prime is 31010312201287. The next prime is 31010312201357. The reversal of 31010312201331 is 13310221301013.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-31010312201331 is a prime.
It is a super-2 number, since 2×310103122013312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31010312201298 and 31010312201307.
It is not an unprimeable number, because it can be changed into a prime (31010312201131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27173325 + ... + 28291521.
It is an arithmetic number, because the mean of its divisors is an integer number (2736211496634).
Almost surely, 231010312201331 is an apocalyptic number.
31010312201331 is a deficient number, since it is larger than the sum of its proper divisors (12769071744813).
31010312201331 is a wasteful number, since it uses less digits than its factorization.
31010312201331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1661990.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31010312201331 its reverse (13310221301013), we get a palindrome (44320533502344).
The spelling of 31010312201331 in words is "thirty-one trillion, ten billion, three hundred twelve million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •