Base | Representation |
---|---|
bin | 1110001010010110111011… |
… | …10011101100001011100001 |
3 | 11002021011112211212202002102 |
4 | 13011023131303230023201 |
5 | 13040213243424223131 |
6 | 150122313410300145 |
7 | 6362644411111322 |
oct | 705133563541341 |
9 | 132234484782072 |
10 | 31142234211041 |
11 | 9a17390376998 |
12 | 35ab6a7287655 |
13 | 144b914119035 |
14 | 799413a46449 |
15 | 39013348a1cb |
hex | 1c52ddcec2e1 |
31142234211041 has 2 divisors, whose sum is σ = 31142234211042. Its totient is φ = 31142234211040.
The previous prime is 31142234211019. The next prime is 31142234211059. The reversal of 31142234211041 is 14011243224113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25348002702400 + 5794231508641 = 5034680^2 + 2407121^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31142234211041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31142234210995 and 31142234211013.
It is not a weakly prime, because it can be changed into another prime (31142234111041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15571117105520 + 15571117105521.
It is an arithmetic number, because the mean of its divisors is an integer number (15571117105521).
Almost surely, 231142234211041 is an apocalyptic number.
It is an amenable number.
31142234211041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31142234211041 is an equidigital number, since it uses as much as digits as its factorization.
31142234211041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 31142234211041 its reverse (14011243224113), we get a palindrome (45153477435154).
The spelling of 31142234211041 in words is "thirty-one trillion, one hundred forty-two billion, two hundred thirty-four million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •