Base | Representation |
---|---|
bin | 1110001010101011110000… |
… | …00001000110111011001001 |
3 | 11002022020101210122110012202 |
4 | 13011111320001012323021 |
5 | 13040404141301314223 |
6 | 150131402443245545 |
7 | 6363521401214003 |
oct | 705257001067311 |
9 | 132266353573182 |
10 | 31153411354313 |
11 | 9a210a65a6086 |
12 | 35b18a65198b5 |
13 | 144c9a5957191 |
14 | 799b94269373 |
15 | 39058986b428 |
hex | 1c5578046ec9 |
31153411354313 has 2 divisors, whose sum is σ = 31153411354314. Its totient is φ = 31153411354312.
The previous prime is 31153411354283. The next prime is 31153411354321. The reversal of 31153411354313 is 31345311435113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30928814031424 + 224597322889 = 5561368^2 + 473917^2 .
It is a cyclic number.
It is not a de Polignac number, because 31153411354313 - 214 = 31153411337929 is a prime.
It is a super-2 number, since 2×311534113543132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31153411359313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15576705677156 + 15576705677157.
It is an arithmetic number, because the mean of its divisors is an integer number (15576705677157).
Almost surely, 231153411354313 is an apocalyptic number.
It is an amenable number.
31153411354313 is a deficient number, since it is larger than the sum of its proper divisors (1).
31153411354313 is an equidigital number, since it uses as much as digits as its factorization.
31153411354313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 97200, while the sum is 38.
Adding to 31153411354313 its reverse (31345311435113), we get a palindrome (62498722789426).
The spelling of 31153411354313 in words is "thirty-one trillion, one hundred fifty-three billion, four hundred eleven million, three hundred fifty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •