Base | Representation |
---|---|
bin | 1110000110100100101110… |
… | …01111001010110110010011 |
3 | 11001210201220121212001010012 |
4 | 13003102113033022312103 |
5 | 13031100442002311311 |
6 | 145542450352025135 |
7 | 6350362153631612 |
oct | 703222717126623 |
9 | 131721817761105 |
10 | 31012201213331 |
11 | 997722310a128 |
12 | 358a4575321ab |
13 | 143c59045cc40 |
14 | 792dda02b879 |
15 | 38ba727a978b |
hex | 1c34973cad93 |
31012201213331 has 32 divisors (see below), whose sum is σ = 33561588392640. Its totient is φ = 28486676275200.
The previous prime is 31012201213309. The next prime is 31012201213351. The reversal of 31012201213331 is 13331210221013.
It is a de Polignac number, because none of the positive numbers 2k-31012201213331 is a prime.
It is a super-2 number, since 2×310122012133312 (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 = 31012201213297 and 31012201213306.
It is not an unprimeable number, because it can be changed into a prime (31012201213351) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3456934676 + ... + 3456943646.
It is an arithmetic number, because the mean of its divisors is an integer number (1048799637270).
Almost surely, 231012201213331 is an apocalyptic number.
31012201213331 is a deficient number, since it is larger than the sum of its proper divisors (2549387179309).
31012201213331 is a wasteful number, since it uses less digits than its factorization.
31012201213331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10967.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31012201213331 its reverse (13331210221013), we get a palindrome (44343411434344).
The spelling of 31012201213331 in words is "thirty-one trillion, twelve billion, two hundred one million, two hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •