Base | Representation |
---|---|
bin | 10010110101001110… |
… | …00000101000001100 |
3 | 222002120221210221200 |
4 | 21122213000220030 |
5 | 131201142011340 |
6 | 4351114425500 |
7 | 505352343000 |
oct | 113247005014 |
9 | 28076853850 |
10 | 10110110220 |
11 | 43189914a1 |
12 | 1b61a32290 |
13 | c51760a52 |
14 | 6bca26700 |
15 | 3e28ad330 |
hex | 25a9c0a0c |
10110110220 has 144 divisors (see below), whose sum is σ = 35763873600. Its totient is φ = 2310868224.
The previous prime is 10110110203. The next prime is 10110110233. The reversal of 10110110220 is 2201101101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20137 + ... + 143616.
Almost surely, 210110110220 is an apocalyptic number.
10110110220 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 10110110220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17881936800).
10110110220 is an abundant number, since it is smaller than the sum of its proper divisors (25653763380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110110220 is a wasteful number, since it uses less digits than its factorization.
10110110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163789 (or 163770 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10110110220 its reverse (2201101101), we get a palindrome (12311211321).
The spelling of 10110110220 in words is "ten billion, one hundred ten million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •