Base | Representation |
---|---|
bin | 1110000110100110100101… |
… | …10110010100101100101001 |
3 | 11001210211111022202101102122 |
4 | 13003103102312110230221 |
5 | 13031110014020124113 |
6 | 145543133520041025 |
7 | 6350426016541523 |
oct | 703232266245451 |
9 | 131724438671378 |
10 | 31013201333033 |
11 | 9977696704937 |
12 | 358a696463175 |
13 | 143c6bc70c74a |
14 | 793092baaa13 |
15 | 38bad04b1408 |
hex | 1c34d2d94b29 |
31013201333033 has 2 divisors, whose sum is σ = 31013201333034. Its totient is φ = 31013201333032.
The previous prime is 31013201332963. The next prime is 31013201333063. The reversal of 31013201333033 is 33033310231013.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30924142658704 + 89058674329 = 5560948^2 + 298427^2 .
It is a cyclic number.
It is not a de Polignac number, because 31013201333033 - 220 = 31013200284457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31013201332993 and 31013201333011.
It is not a weakly prime, because it can be changed into another prime (31013201333063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15506600666516 + 15506600666517.
It is an arithmetic number, because the mean of its divisors is an integer number (15506600666517).
Almost surely, 231013201333033 is an apocalyptic number.
It is an amenable number.
31013201333033 is a deficient number, since it is larger than the sum of its proper divisors (1).
31013201333033 is an equidigital number, since it uses as much as digits as its factorization.
31013201333033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 31013201333033 its reverse (33033310231013), we get a palindrome (64046511564046).
The spelling of 31013201333033 in words is "thirty-one trillion, thirteen billion, two hundred one million, three hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •