Base | Representation |
---|---|
bin | 1110001010011000110000… |
… | …00010101111010000001001 |
3 | 11002021021001221022200001112 |
4 | 13011030120002233100021 |
5 | 13040222244033444223 |
6 | 150122554351300105 |
7 | 6363010543504553 |
oct | 705143002572011 |
9 | 132237057280045 |
10 | 31143211234313 |
11 | 9a17841926a42 |
12 | 35ab91a51a635 |
13 | 144ba3b66cc09 |
14 | 7994a76d24d3 |
15 | 39018e12d778 |
hex | 1c53180af409 |
31143211234313 has 2 divisors, whose sum is σ = 31143211234314. Its totient is φ = 31143211234312.
The previous prime is 31143211234283. The next prime is 31143211234319. The reversal of 31143211234313 is 31343211234113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16109081286544 + 15034129947769 = 4013612^2 + 3877387^2 .
It is a cyclic number.
It is not a de Polignac number, because 31143211234313 - 26 = 31143211234249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31143211234313.
It is not a weakly prime, because it can be changed into another prime (31143211234319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15571605617156 + 15571605617157.
It is an arithmetic number, because the mean of its divisors is an integer number (15571605617157).
Almost surely, 231143211234313 is an apocalyptic number.
It is an amenable number.
31143211234313 is a deficient number, since it is larger than the sum of its proper divisors (1).
31143211234313 is an equidigital number, since it uses as much as digits as its factorization.
31143211234313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 15552, while the sum is 32.
Adding to 31143211234313 its reverse (31343211234113), we get a palindrome (62486422468426).
The spelling of 31143211234313 in words is "thirty-one trillion, one hundred forty-three billion, two hundred eleven million, two hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •