Base | Representation |
---|---|
bin | 11100111101111001… |
… | …010110000111011001 |
3 | 2222021122011222112102 |
4 | 130331321112013121 |
5 | 1002144410322131 |
6 | 22142201453145 |
7 | 2150523646214 |
oct | 347571260731 |
9 | 88248158472 |
10 | 31103214041 |
11 | 12210a54079 |
12 | 60404a11b5 |
13 | 2c18acc983 |
14 | 1710b8277b |
15 | c208e71cb |
hex | 73de561d9 |
31103214041 has 2 divisors, whose sum is σ = 31103214042. Its totient is φ = 31103214040.
The previous prime is 31103214013. The next prime is 31103214049. The reversal of 31103214041 is 14041230113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18671856025 + 12431358016 = 136645^2 + 111496^2 .
It is an emirp because it is prime and its reverse (14041230113) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31103214041 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (31103214049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15551607020 + 15551607021.
It is an arithmetic number, because the mean of its divisors is an integer number (15551607021).
Almost surely, 231103214041 is an apocalyptic number.
It is an amenable number.
31103214041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31103214041 is an equidigital number, since it uses as much as digits as its factorization.
31103214041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 31103214041 its reverse (14041230113), we get a palindrome (45144444154).
The spelling of 31103214041 in words is "thirty-one billion, one hundred three million, two hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •