Base | Representation |
---|---|
bin | 1010001101001010010011… |
… | …0101010100111110011000 |
3 | 1110201201221010011002000221 |
4 | 2203102210311110332120 |
5 | 2432322024311120440 |
6 | 35510542440205424 |
7 | 2235464202264235 |
oct | 243224465247630 |
9 | 43651833132027 |
10 | 11221220020120 |
11 | 363699018a320 |
12 | 13128b7a69874 |
13 | 635205b01946 |
14 | 2ab1779a078c |
15 | 146d52a3bd4a |
hex | a34a4d54f98 |
11221220020120 has 64 divisors (see below), whose sum is σ = 28287399895200. Its totient is φ = 3970161377280.
The previous prime is 11221220020091. The next prime is 11221220020121. The reversal of 11221220020120 is 2102002212211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11221220020094 and 11221220020103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221220020121) 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, 344615785 + ... + 344648344.
Almost surely, 211221220020120 is an apocalyptic number.
11221220020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11221220020120 is an abundant number, since it is smaller than the sum of its proper divisors (17066179875080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221220020120 is a wasteful number, since it uses less digits than its factorization.
11221220020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689264188 (or 689264184 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11221220020120 its reverse (2102002212211), we get a palindrome (13323222232331).
The spelling of 11221220020120 in words is "eleven trillion, two hundred twenty-one billion, two hundred twenty million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •