Base | Representation |
---|---|
bin | 1010001101000110100101… |
… | …0010110111010100110001 |
3 | 1110201122100111120012102210 |
4 | 2203101221102313110301 |
5 | 2432313003102130113 |
6 | 35510255354402333 |
7 | 2235430352665236 |
oct | 243215122672461 |
9 | 43648314505383 |
10 | 11220221130033 |
11 | 3636518354423 |
12 | 13126794303a9 |
13 | 6350a6b92a16 |
14 | 2ab0c106178d |
15 | 146ce4ec96c3 |
hex | a34694b7531 |
11220221130033 has 32 divisors (see below), whose sum is σ = 15949565884800. Its totient is φ = 6991598996480.
The previous prime is 11220221130029. The next prime is 11220221130043. The reversal of 11220221130033 is 33003112202211.
It is a cyclic number.
It is not a de Polignac number, because 11220221130033 - 22 = 11220221130029 is a prime.
It is a super-2 number, since 2×112202211300332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11220221129991 and 11220221130009.
It is not an unprimeable number, because it can be changed into a prime (11220221130023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41896591 + ... + 42163547.
It is an arithmetic number, because the mean of its divisors is an integer number (498423933900).
Almost surely, 211220221130033 is an apocalyptic number.
It is an amenable number.
11220221130033 is a deficient number, since it is larger than the sum of its proper divisors (4729344754767).
11220221130033 is a wasteful number, since it uses less digits than its factorization.
11220221130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272657.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 11220221130033 its reverse (33003112202211), we get a palindrome (44223333332244).
The spelling of 11220221130033 in words is "eleven trillion, two hundred twenty billion, two hundred twenty-one million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •