Base | Representation |
---|---|
bin | 10000001001110010010… |
… | …111000100010110000100 |
3 | 10221010011012212021122102 |
4 | 100021302113010112010 |
5 | 121141310133241400 |
6 | 2205534121251232 |
7 | 143124223060622 |
oct | 20116227042604 |
9 | 3833135767572 |
10 | 1110020212100 |
11 | 398836520718 |
12 | 15b167633b18 |
13 | 8089ca21567 |
14 | 3ba221ac512 |
15 | 1dd1a5029d5 |
hex | 102725c4584 |
1110020212100 has 72 divisors (see below), whose sum is σ = 2449952568000. Its totient is φ = 436414364800.
The previous prime is 1110020212099. The next prime is 1110020212129. The reversal of 1110020212100 is 12120200111.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55632926 + ... + 55652874.
It is an arithmetic number, because the mean of its divisors is an integer number (34027119000).
Almost surely, 21110020212100 is an apocalyptic number.
1110020212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1110020212100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1224976284000).
1110020212100 is an abundant number, since it is smaller than the sum of its proper divisors (1339932355900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110020212100 is a wasteful number, since it uses less digits than its factorization.
1110020212100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29453 (or 29446 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1110020212100 its reverse (12120200111), we get a palindrome (1122140412211).
The spelling of 1110020212100 in words is "one trillion, one hundred ten billion, twenty million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •