Base | Representation |
---|---|
bin | 10000001001110111000… |
… | …111110111001011101111 |
3 | 10221010100210012121212002 |
4 | 100021313013313023233 |
5 | 121141441112041421 |
6 | 2205550054002515 |
7 | 143126213156354 |
oct | 20116707671357 |
9 | 3833323177762 |
10 | 1110100112111 |
11 | 398877633791 |
12 | 15b18a34643b |
13 | 808b3448283 |
14 | 3ba2ca4a62b |
15 | 1dd22536b0b |
hex | 102771f72ef |
1110100112111 has 16 divisors (see below), whose sum is σ = 1137847772160. Its totient is φ = 1082441673600.
The previous prime is 1110100112101. The next prime is 1110100112159. The reversal of 1110100112111 is 1112110010111.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110100112111 is a prime.
It is a super-3 number, since 3×11101001121113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110100112092 and 1110100112101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110100112101) 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, 78998036 + ... + 79012086.
It is an arithmetic number, because the mean of its divisors is an integer number (71115485760).
Almost surely, 21110100112111 is an apocalyptic number.
1110100112111 is a deficient number, since it is larger than the sum of its proper divisors (27747660049).
1110100112111 is a wasteful number, since it uses less digits than its factorization.
1110100112111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17086.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1110100112111 its reverse (1112110010111), we get a palindrome (2222210122222).
The spelling of 1110100112111 in words is "one trillion, one hundred ten billion, one hundred million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •