Base | Representation |
---|---|
bin | 1010001101001101111101… |
… | …0100001110110111101110 |
3 | 1110201211110111102011221120 |
4 | 2203103133110032313232 |
5 | 2432331032001400420 |
6 | 35511224050241410 |
7 | 2235530415212265 |
oct | 243233724166756 |
9 | 43654414364846 |
10 | 11222201200110 |
11 | 363734401937a |
12 | 1312b30586266 |
13 | 63533117c814 |
14 | 2ab22c00d5dc |
15 | 146dadc51d40 |
hex | a34df50edee |
11222201200110 has 32 divisors (see below), whose sum is σ = 26982521096832. Its totient is φ = 2987116073760.
The previous prime is 11222201200081. The next prime is 11222201200121. The reversal of 11222201200110 is 1100210222211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11222201200110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 341915376 + ... + 341948195.
It is an arithmetic number, because the mean of its divisors is an integer number (843203784276).
Almost surely, 211222201200110 is an apocalyptic number.
11222201200110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11222201200110 is an abundant number, since it is smaller than the sum of its proper divisors (15760319896722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222201200110 is a wasteful number, since it uses less digits than its factorization.
11222201200110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 683864128.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11222201200110 its reverse (1100210222211), we get a palindrome (12322411422321).
The spelling of 11222201200110 in words is "eleven trillion, two hundred twenty-two billion, two hundred one million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •