Base | Representation |
---|---|
bin | 1110000110111111000001… |
… | …00001001001000000100001 |
3 | 11001212002100021111022000011 |
4 | 13003133200201021000201 |
5 | 13031313343241004131 |
6 | 145553143111324521 |
7 | 6351402010626331 |
oct | 703374041110041 |
9 | 131762307438004 |
10 | 31026315563041 |
11 | 998220630aa57 |
12 | 3591136380741 |
13 | 14409cc667c66 |
14 | 79397878d0c1 |
15 | 38c0eb9790b1 |
hex | 1c37e0849021 |
31026315563041 has 2 divisors, whose sum is σ = 31026315563042. Its totient is φ = 31026315563040.
The previous prime is 31026315563029. The next prime is 31026315563051. The reversal of 31026315563041 is 14036551362013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27776483715600 + 3249831847441 = 5270340^2 + 1802729^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31026315563041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31026315562985 and 31026315563003.
It is not a weakly prime, because it can be changed into another prime (31026315563051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15513157781520 + 15513157781521.
It is an arithmetic number, because the mean of its divisors is an integer number (15513157781521).
Almost surely, 231026315563041 is an apocalyptic number.
It is an amenable number.
31026315563041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31026315563041 is an equidigital number, since it uses as much as digits as its factorization.
31026315563041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 40.
The spelling of 31026315563041 in words is "thirty-one trillion, twenty-six billion, three hundred fifteen million, five hundred sixty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •