Base | Representation |
---|---|
bin | 1010001101000101110011… |
… | …0101111011111011011000 |
3 | 1110201121210221110110220121 |
4 | 2203101130311323323120 |
5 | 2432312041112020440 |
6 | 35510222533003024 |
7 | 2235422235201364 |
oct | 243213465737330 |
9 | 43647727413817 |
10 | 11220012220120 |
11 | 3636420436300 |
12 | 131261b483474 |
13 | 6350728090a2 |
14 | 2ab0a14002a4 |
15 | 146cd19b034a |
hex | a345cd7bed8 |
11220012220120 has 48 divisors (see below), whose sum is σ = 27748666597680. Its totient is φ = 4080004441920.
The previous prime is 11220012220073. The next prime is 11220012220163. The reversal of 11220012220120 is 2102221002211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11220012220094 and 11220012220103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1159087332 + ... + 1159097011.
It is an arithmetic number, because the mean of its divisors is an integer number (578097220785).
Almost surely, 211220012220120 is an apocalyptic number.
11220012220120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11220012220120 is an abundant number, since it is smaller than the sum of its proper divisors (16528654377560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220012220120 is a wasteful number, since it uses less digits than its factorization.
11220012220120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2318184376 (or 2318184361 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11220012220120 its reverse (2102221002211), we get a palindrome (13322233222331).
The spelling of 11220012220120 in words is "eleven trillion, two hundred twenty billion, twelve million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •