Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1110101000111110101110 |
3 | 1022210111221022200120022021 |
4 | 2103013300332220332232 |
5 | 2311120441324000420 |
6 | 33300303303340354 |
7 | 2062300504403566 |
oct | 223076076507656 |
9 | 38714838616267 |
10 | 10110101000110 |
11 | 3248740498aa1 |
12 | 11734a44516ba |
13 | 5844bc5591b7 |
14 | 26d48d8c3da6 |
15 | 127ec0d3b7aa |
hex | 931f0fa8fae |
10110101000110 has 8 divisors (see below), whose sum is σ = 18198181800216. Its totient is φ = 4044040400040.
The previous prime is 10110101000023. The next prime is 10110101000113. The reversal of 10110101000110 is 1100010101101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10110101000093 and 10110101000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110101000113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505505049996 + ... + 505505050015.
It is an arithmetic number, because the mean of its divisors is an integer number (2274772725027).
Almost surely, 210110101000110 is an apocalyptic number.
10110101000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10110101000110 is a deficient number, since it is larger than the sum of its proper divisors (8088080800106).
10110101000110 is a wasteful number, since it uses less digits than its factorization.
10110101000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011010100018.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10110101000110 its reverse (1100010101101), we get a palindrome (11210111101211).
The spelling of 10110101000110 in words is "ten trillion, one hundred ten billion, one hundred one 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 •