Base | Representation |
---|---|
bin | 1001000110111110110110… |
… | …10101010110110100010001 |
3 | 2121220221210122202121112202 |
4 | 10203133123111112310101 |
5 | 10111142204222410113 |
6 | 110334055502532545 |
7 | 4135125431214056 |
oct | 443373325266421 |
9 | 77827718677482 |
10 | 20031112310033 |
11 | 6423168764060 |
12 | 22b61b6b97155 |
13 | b23c05c49946 |
14 | 4d37222cb02d |
15 | 24b0c6478258 |
hex | 1237db556d11 |
20031112310033 has 16 divisors (see below), whose sum is σ = 21870407592000. Its totient is φ = 18194870676480.
The previous prime is 20031112309997. The next prime is 20031112310047. The reversal of 20031112310033 is 33001321113002.
It is a cyclic number.
It is not a de Polignac number, because 20031112310033 - 222 = 20031108115729 is a prime.
It is a super-2 number, since 2×200311123100332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20031112309987 and 20031112310014.
It is not an unprimeable number, because it can be changed into a prime (20031112310093) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66222785 + ... + 66524577.
It is an arithmetic number, because the mean of its divisors is an integer number (1366900474500).
Almost surely, 220031112310033 is an apocalyptic number.
It is an amenable number.
20031112310033 is a deficient number, since it is larger than the sum of its proper divisors (1839295281967).
20031112310033 is a wasteful number, since it uses less digits than its factorization.
20031112310033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306832.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20031112310033 its reverse (33001321113002), we get a palindrome (53032433423035).
The spelling of 20031112310033 in words is "twenty trillion, thirty-one billion, one hundred twelve million, three hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •