Base | Representation |
---|---|
bin | 1110000111001001110111… |
… | …11111001110100101001101 |
3 | 11001212122101112212200220021 |
4 | 13003210323333032211031 |
5 | 13031412313124103031 |
6 | 145555545355422141 |
7 | 6351666325352521 |
oct | 703447377164515 |
9 | 131778345780807 |
10 | 31032145144141 |
11 | 9984727a22579 |
12 | 35922a2754951 |
13 | 144141b335b2b |
14 | 793d6cab9d81 |
15 | 38c33d64c511 |
hex | 1c393bfce94d |
31032145144141 has 2 divisors, whose sum is σ = 31032145144142. Its totient is φ = 31032145144140.
The previous prime is 31032145144111. The next prime is 31032145144199. The reversal of 31032145144141 is 14144154123013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25821174754116 + 5210970390025 = 5081454^2 + 2282755^2 .
It is a cyclic number.
It is not a de Polignac number, because 31032145144141 - 25 = 31032145144109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31032145144097 and 31032145144106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31032145144111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15516072572070 + 15516072572071.
It is an arithmetic number, because the mean of its divisors is an integer number (15516072572071).
Almost surely, 231032145144141 is an apocalyptic number.
It is an amenable number.
31032145144141 is a deficient number, since it is larger than the sum of its proper divisors (1).
31032145144141 is an equidigital number, since it uses as much as digits as its factorization.
31032145144141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 31032145144141 its reverse (14144154123013), we get a palindrome (45176299267154).
The spelling of 31032145144141 in words is "thirty-one trillion, thirty-two billion, one hundred forty-five million, one hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •