Base | Representation |
---|---|
bin | 1010001101000110001010… |
… | …1011010111000111101010 |
3 | 1110201122001202122212020112 |
4 | 2203101202223113013222 |
5 | 2432312241142024320 |
6 | 35510240351054322 |
7 | 2235424534231220 |
oct | 243214253270752 |
9 | 43648052585215 |
10 | 11220110111210 |
11 | 3636470717330 |
12 | 13126482113a2 |
13 | 635089b91a00 |
14 | 2ab0b0402b10 |
15 | 146cda399ec5 |
hex | a3462ad71ea |
11220110111210 has 192 divisors, whose sum is σ = 28869428484864. Its totient is φ = 3038270976000.
The previous prime is 11220110111207. The next prime is 11220110111279. The reversal of 11220110111210 is 1211101102211.
11220110111210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 323741 + ... + 4748160.
It is an arithmetic number, because the mean of its divisors is an integer number (150361606692).
Almost surely, 211220110111210 is an apocalyptic number.
11220110111210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11220110111210 is an abundant number, since it is smaller than the sum of its proper divisors (17649318373654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220110111210 is a wasteful number, since it uses less digits than its factorization.
11220110111210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5071969 (or 5071956 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11220110111210 its reverse (1211101102211), we get a palindrome (12431211213421).
The spelling of 11220110111210 in words is "eleven trillion, two hundred twenty billion, one hundred ten million, one hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •