Base | Representation |
---|---|
bin | 1110000111011110110111… |
… | …00111001110101000101001 |
3 | 11001220201110211121022011102 |
4 | 13003233123213032220221 |
5 | 13032103402231021212 |
6 | 150005051440011145 |
7 | 6352545500640431 |
oct | 703573347165051 |
9 | 131821424538142 |
10 | 31043413142057 |
11 | 998948a467148 |
12 | 3594508300ab5 |
13 | 14424c5934c14 |
14 | 79471b3cd2c1 |
15 | 38c79c9c85c2 |
hex | 1c3bdb9cea29 |
31043413142057 has 2 divisors, whose sum is σ = 31043413142058. Its totient is φ = 31043413142056.
The previous prime is 31043413142029. The next prime is 31043413142117. The reversal of 31043413142057 is 75024131434013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21144215744656 + 9899197397401 = 4598284^2 + 3146299^2 .
It is a cyclic number.
It is not a de Polignac number, because 31043413142057 - 220 = 31043412093481 is a prime.
It is a super-2 number, since 2×310434131420572 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31043413142057.
It is not a weakly prime, because it can be changed into another prime (31043413142857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15521706571028 + 15521706571029.
It is an arithmetic number, because the mean of its divisors is an integer number (15521706571029).
Almost surely, 231043413142057 is an apocalyptic number.
It is an amenable number.
31043413142057 is a deficient number, since it is larger than the sum of its proper divisors (1).
31043413142057 is an equidigital number, since it uses as much as digits as its factorization.
31043413142057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120960, while the sum is 38.
The spelling of 31043413142057 in words is "thirty-one trillion, forty-three billion, four hundred thirteen million, one hundred forty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •