Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …10100011010111101110 |
3 | 10120122211222211220111121 |
4 | 32231222312203113232 |
5 | 113031223130000420 |
6 | 2052255244211154 |
7 | 133023151123630 |
oct | 16555266432756 |
9 | 3518758756447 |
10 | 1011110000110 |
11 | 35a89a265471 |
12 | 143b62839aba |
13 | 74468c285c2 |
14 | 36d1bb8ca50 |
15 | 1b47bcd32aa |
hex | eb6ada35ee |
1011110000110 has 32 divisors (see below), whose sum is σ = 2202350523840. Its totient is φ = 326274150912.
The previous prime is 1011110000053. The next prime is 1011110000113. The reversal of 1011110000110 is 110000111101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 1011110000093 and 1011110000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011110000113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 424834945 + ... + 424837324.
It is an arithmetic number, because the mean of its divisors is an integer number (68823453870).
Almost surely, 21011110000110 is an apocalyptic number.
1011110000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011110000110 is an abundant number, since it is smaller than the sum of its proper divisors (1191240523730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011110000110 is a wasteful number, since it uses less digits than its factorization.
1011110000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 849672300.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1011110000110 its reverse (110000111101), we get a palindrome (1121110111211).
The spelling of 1011110000110 in words is "one trillion, eleven billion, one hundred ten million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •