Base | Representation |
---|---|
bin | 1001010010010111010110… |
… | …1001010010011001001110 |
3 | 1100011011122212212020112010 |
4 | 2110211311221102121032 |
5 | 2314244323410120420 |
6 | 33414530350522050 |
7 | 2102504564405040 |
oct | 224456551223116 |
9 | 40134585766463 |
10 | 10211111020110 |
11 | 3287564a71070 |
12 | 118ab94506326 |
13 | 590b993a37c0 |
14 | 274312b3da90 |
15 | 12a933a864e0 |
hex | 94975a5264e |
10211111020110 has 512 divisors, whose sum is σ = 33378475769856. Its totient is φ = 1930510080000.
The previous prime is 10211111020109. The next prime is 10211111020199. The reversal of 10211111020110 is 1102011111201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 688490395 + ... + 688505225.
It is an arithmetic number, because the mean of its divisors is an integer number (65192335488).
Almost surely, 210211111020110 is an apocalyptic number.
10211111020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10211111020110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16689237884928).
10211111020110 is an abundant number, since it is smaller than the sum of its proper divisors (23167364749746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211111020110 is a wasteful number, since it uses less digits than its factorization.
10211111020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15200.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10211111020110 its reverse (1102011111201), we get a palindrome (11313122131311).
The spelling of 10211111020110 in words is "ten trillion, two hundred eleven billion, one hundred eleven million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •