Base | Representation |
---|---|
bin | 1110001100000100101000… |
… | …11010000111000111011001 |
3 | 11002110210120120001020011001 |
4 | 13012002110122013013121 |
5 | 13042144404332423001 |
6 | 150205334033105001 |
7 | 6400131100520422 |
oct | 706022432070731 |
9 | 132423516036131 |
10 | 31201132311001 |
11 | 9a3a364861164 |
12 | 35baba40b8161 |
13 | 145433c4ab763 |
14 | 79c200024649 |
15 | 39192e0ce001 |
hex | 1c60946871d9 |
31201132311001 has 2 divisors, whose sum is σ = 31201132311002. Its totient is φ = 31201132311000.
The previous prime is 31201132310981. The next prime is 31201132311053. The reversal of 31201132311001 is 10011323110213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19308642105600 + 11892490205401 = 4394160^2 + 3448549^2 .
It is a cyclic number.
It is not a de Polignac number, because 31201132311001 - 227 = 31200998093273 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31201132311001.
It is not a weakly prime, because it can be changed into another prime (31201132111001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15600566155500 + 15600566155501.
It is an arithmetic number, because the mean of its divisors is an integer number (15600566155501).
Almost surely, 231201132311001 is an apocalyptic number.
It is an amenable number.
31201132311001 is a deficient number, since it is larger than the sum of its proper divisors (1).
31201132311001 is an equidigital number, since it uses as much as digits as its factorization.
31201132311001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 31201132311001 its reverse (10011323110213), we get a palindrome (41212455421214).
The spelling of 31201132311001 in words is "thirty-one trillion, two hundred one billion, one hundred thirty-two million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •