Base | Representation |
---|---|
bin | 10110110000110011110101… |
… | …001011101000011010101100 |
3 | 111010110112112102210221202021 |
4 | 112300303311023220122230 |
5 | 101110210230031432340 |
6 | 552530242220435524 |
7 | 30041540065565431 |
oct | 2660636513503254 |
9 | 433415472727667 |
10 | 100111211202220 |
11 | 29997a20914459 |
12 | b28a2820a8ba4 |
13 | 43b25a655a14a |
14 | 1aa15a0bddb88 |
15 | b891c7db6e4a |
hex | 5b0cf52e86ac |
100111211202220 has 24 divisors (see below), whose sum is σ = 214706597644224. Its totient is φ = 39192474172416.
The previous prime is 100111211202209. The next prime is 100111211202239. The reversal of 100111211202220 is 22202112111001.
It is a junction number, because it is equal to n+sod(n) for n = 100111211202194 and 100111211202203.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53250643317 + ... + 53250645196.
It is an arithmetic number, because the mean of its divisors is an integer number (8946108235176).
Almost surely, 2100111211202220 is an apocalyptic number.
100111211202220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100111211202220 is an abundant number, since it is smaller than the sum of its proper divisors (114595386442004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111211202220 is a wasteful number, since it uses less digits than its factorization.
100111211202220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106501288569 (or 106501288567 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100111211202220 its reverse (22202112111001), we get a palindrome (122313323313221).
The spelling of 100111211202220 in words is "one hundred trillion, one hundred eleven billion, two hundred eleven million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •