Base | Representation |
---|---|
bin | 1110001100011011000111… |
… | …10000100011010110100011 |
3 | 11002111221201122102202201210 |
4 | 13012031203300203112203 |
5 | 13042344113424342011 |
6 | 150215051355201203 |
7 | 6401036135011125 |
oct | 706154360432643 |
9 | 132457648382653 |
10 | 31213201012131 |
11 | 9a44498276a26 |
12 | 36013b1a46203 |
13 | 1455513948828 |
14 | 79ca26c07215 |
15 | 391dd88c06a6 |
hex | 1c6363c235a3 |
31213201012131 has 16 divisors (see below), whose sum is σ = 42300517112480. Its totient is φ = 20467353438720.
The previous prime is 31213201012129. The next prime is 31213201012267. The reversal of 31213201012131 is 13121010231213.
It is not a de Polignac number, because 31213201012131 - 21 = 31213201012129 is a prime.
It is a super-2 number, since 2×312132010121312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31213201012098 and 31213201012107.
It is not an unprimeable number, because it can be changed into a prime (31213201011131) 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, 10727685 + ... + 13323273.
It is an arithmetic number, because the mean of its divisors is an integer number (2643782319530).
Almost surely, 231213201012131 is an apocalyptic number.
31213201012131 is a deficient number, since it is larger than the sum of its proper divisors (11087316100349).
31213201012131 is a wasteful number, since it uses less digits than its factorization.
31213201012131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2661366.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 31213201012131 its reverse (13121010231213), we get a palindrome (44334211243344).
The spelling of 31213201012131 in words is "thirty-one trillion, two hundred thirteen billion, two hundred one million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •