Base | Representation |
---|---|
bin | 1110000111001011011111… |
… | …01010011100101010000001 |
3 | 11001212201121222020020020000 |
4 | 13003211233222130222001 |
5 | 13031421102100041001 |
6 | 150000211405510213 |
7 | 6352026653433564 |
oct | 703455752345201 |
9 | 131781558206200 |
10 | 31033012112001 |
11 | 9985032343339 |
12 | 35924a4b72369 |
13 | 1441528b35373 |
14 | 794011cb84db |
15 | 38c38e801a86 |
hex | 1c396fa9ca81 |
31033012112001 has 20 divisors (see below), whose sum is σ = 46369266438000. Its totient is φ = 20683627270776.
The previous prime is 31033012111973. The next prime is 31033012112021. The reversal of 31033012112001 is 10021121033013.
31033012112001 is a `hidden beast` number, since 3 + 10 + 330 + 121 + 1 + 200 + 1 = 666.
It is not a de Polignac number, because 31033012112001 - 210 = 31033012110977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31033012112021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 46401771 + ... + 47065808.
It is an arithmetic number, because the mean of its divisors is an integer number (2318463321900).
Almost surely, 231033012112001 is an apocalyptic number.
It is an amenable number.
31033012112001 is a deficient number, since it is larger than the sum of its proper divisors (15336254325999).
31033012112001 is an equidigital number, since it uses as much as digits as its factorization.
31033012112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93471690 (or 93471681 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 31033012112001 its reverse (10021121033013), we get a palindrome (41054133145014).
The spelling of 31033012112001 in words is "thirty-one trillion, thirty-three billion, twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •