Base | Representation |
---|---|
bin | 1110000110100110101000… |
… | …00101100101011100101101 |
3 | 11001210211112202212000110202 |
4 | 13003103110011211130231 |
5 | 13031110034330023041 |
6 | 145543135541243245 |
7 | 6350426361260663 |
oct | 703232405453455 |
9 | 131724482760422 |
10 | 31013222111021 |
11 | 99776a7406727 |
12 | 358a6a1403525 |
13 | 143c6c3b06007 |
14 | 793095858c33 |
15 | 38bad2217a9b |
hex | 1c34d416572d |
31013222111021 has 2 divisors, whose sum is σ = 31013222111022. Its totient is φ = 31013222111020.
The previous prime is 31013222111009. The next prime is 31013222111057. The reversal of 31013222111021 is 12011122231013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19083451508521 + 11929770602500 = 4368461^2 + 3453950^2 .
It is a cyclic number.
It is not a de Polignac number, because 31013222111021 - 230 = 31012148369197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31013222110984 and 31013222111002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31013222111821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15506611055510 + 15506611055511.
It is an arithmetic number, because the mean of its divisors is an integer number (15506611055511).
Almost surely, 231013222111021 is an apocalyptic number.
It is an amenable number.
31013222111021 is a deficient number, since it is larger than the sum of its proper divisors (1).
31013222111021 is an equidigital number, since it uses as much as digits as its factorization.
31013222111021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 31013222111021 its reverse (12011122231013), we get a palindrome (43024344342034).
The spelling of 31013222111021 in words is "thirty-one trillion, thirteen billion, two hundred twenty-two million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •