Base | Representation |
---|---|
bin | 1010001101101110110110… |
… | …0111010100101000000001 |
3 | 1110202200020212021111210002 |
4 | 2203123231213110220001 |
5 | 2433002122420120113 |
6 | 35515244152045345 |
7 | 2236262263354436 |
oct | 243335547245001 |
9 | 43680225244702 |
10 | 11231031020033 |
11 | 3640065244810 |
12 | 1314795693855 |
13 | 63610a5b6836 |
14 | 2ab8289a5b8d |
15 | 147229014c58 |
hex | a36ed9d4a01 |
11231031020033 has 16 divisors (see below), whose sum is σ = 12490915780800. Its totient is φ = 10011197926080.
The previous prime is 11231031020009. The next prime is 11231031020071. The reversal of 11231031020033 is 33002013013211.
It is a cyclic number.
It is not a de Polignac number, because 11231031020033 - 218 = 11231030757889 is a prime.
It is a super-2 number, since 2×112310310200332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11231031019987 and 11231031020014.
It is not an unprimeable number, because it can be changed into a prime (11231031020933) 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, 5005538 + ... + 6893291.
It is an arithmetic number, because the mean of its divisors is an integer number (780682236300).
Almost surely, 211231031020033 is an apocalyptic number.
It is an amenable number.
11231031020033 is a deficient number, since it is larger than the sum of its proper divisors (1259884760767).
11231031020033 is a wasteful number, since it uses less digits than its factorization.
11231031020033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11900512.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11231031020033 its reverse (33002013013211), we get a palindrome (44233044033244).
The spelling of 11231031020033 in words is "eleven trillion, two hundred thirty-one billion, thirty-one million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •