Base | Representation |
---|---|
bin | 1110001111101000001101… |
… | …11000110000110100100101 |
3 | 11002220110221110202012012011 |
4 | 13013310012320300310211 |
5 | 13101200120340024221 |
6 | 150341421512354221 |
7 | 6412014605154556 |
oct | 707640670606445 |
9 | 132813843665164 |
10 | 31323312033061 |
11 | 9a87162055774 |
12 | 361a8019a5971 |
13 | 1462a11147699 |
14 | 7a40b0a4a32d |
15 | 394bd05e81e1 |
hex | 1c7d06e30d25 |
31323312033061 has 2 divisors, whose sum is σ = 31323312033062. Its totient is φ = 31323312033060.
The previous prime is 31323312033053. The next prime is 31323312033109. The reversal of 31323312033061 is 16033021332313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29876117469025 + 1447194564036 = 5465905^2 + 1202994^2 .
It is a cyclic number.
It is not a de Polignac number, because 31323312033061 - 23 = 31323312033053 is a prime.
It is a super-2 number, since 2×313233120330612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31323312033001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15661656016530 + 15661656016531.
It is an arithmetic number, because the mean of its divisors is an integer number (15661656016531).
Almost surely, 231323312033061 is an apocalyptic number.
It is an amenable number.
31323312033061 is a deficient number, since it is larger than the sum of its proper divisors (1).
31323312033061 is an equidigital number, since it uses as much as digits as its factorization.
31323312033061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 31.
Adding to 31323312033061 its reverse (16033021332313), we get a palindrome (47356333365374).
The spelling of 31323312033061 in words is "thirty-one trillion, three hundred twenty-three billion, three hundred twelve million, thirty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •