Base | Representation |
---|---|
bin | 1110001001001110011111… |
… | …00110010101001110000001 |
3 | 11002010110011022200010120011 |
4 | 13010213033212111032001 |
5 | 13034044120311404213 |
6 | 150052402212344521 |
7 | 6360066534240406 |
oct | 704471746251601 |
9 | 132113138603504 |
10 | 31103341122433 |
11 | 9a01942223858 |
12 | 35a4052015141 |
13 | 1448056497238 |
14 | 7975a44962ad |
15 | 38e108c5203d |
hex | 1c49cf995381 |
31103341122433 has 2 divisors, whose sum is σ = 31103341122434. Its totient is φ = 31103341122432.
The previous prime is 31103341122391. The next prime is 31103341122509. The reversal of 31103341122433 is 33422114330113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31050114941169 + 53226181264 = 5572263^2 + 230708^2 .
It is a cyclic number.
It is not a de Polignac number, because 31103341122433 - 225 = 31103307568001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31103341122395 and 31103341122404.
It is not a weakly prime, because it can be changed into another prime (31103341126433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15551670561216 + 15551670561217.
It is an arithmetic number, because the mean of its divisors is an integer number (15551670561217).
Almost surely, 231103341122433 is an apocalyptic number.
It is an amenable number.
31103341122433 is a deficient number, since it is larger than the sum of its proper divisors (1).
31103341122433 is an equidigital number, since it uses as much as digits as its factorization.
31103341122433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 31103341122433 its reverse (33422114330113), we get a palindrome (64525455452546).
The spelling of 31103341122433 in words is "thirty-one trillion, one hundred three billion, three hundred forty-one million, one hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •