Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …101101000011000011111 |
3 | 10221010101121210012000110 |
4 | 100021313311220120133 |
5 | 121142002200010421 |
6 | 2205551203101103 |
7 | 143126420150064 |
oct | 20116765503037 |
9 | 3833347705013 |
10 | 1110112110111 |
11 | 398883388a94 |
12 | 15b192371793 |
13 | 808b5a89394 |
14 | 3ba30490c6b |
15 | 1dd23606a76 |
hex | 10277d6861f |
1110112110111 has 64 divisors (see below), whose sum is σ = 1567752448896. Its totient is φ = 697973760000.
The previous prime is 1110112110067. The next prime is 1110112110119.
1110112110111 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1110112110111 - 213 = 1110112101919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110112110119) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 112116261 + ... + 112126161.
It is an arithmetic number, because the mean of its divisors is an integer number (24496132014).
Almost surely, 21110112110111 is an apocalyptic number.
1110112110111 is a deficient number, since it is larger than the sum of its proper divisors (457640338785).
1110112110111 is a wasteful number, since it uses less digits than its factorization.
1110112110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10252.
The product of its (nonzero) digits is 2, while the sum is 12.
The spelling of 1110112110111 in words is "one trillion, one hundred ten billion, one hundred twelve million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •