Base | Representation |
---|---|
bin | 10000001001110111111… |
… | …001011101010000010111 |
3 | 10221010101200200010212121 |
4 | 100021313321131100113 |
5 | 121142002424104421 |
6 | 2205551240400411 |
7 | 143126431525222 |
oct | 20116771352027 |
9 | 3833350603777 |
10 | 1110113113111 |
11 | 398883a03612 |
12 | 15b192776107 |
13 | 808b604aa82 |
14 | 3ba306725b9 |
15 | 1dd23753d41 |
hex | 10277e5d417 |
1110113113111 has 2 divisors, whose sum is σ = 1110113113112. Its totient is φ = 1110113113110.
The previous prime is 1110113113097. The next prime is 1110113113129. The reversal of 1110113113111 is 1113113110111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110113113111 is a prime.
It is a super-2 number, since 2×11101131131112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110113114111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555056556555 + 555056556556.
It is an arithmetic number, because the mean of its divisors is an integer number (555056556556).
Almost surely, 21110113113111 is an apocalyptic number.
1110113113111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110113113111 is an equidigital number, since it uses as much as digits as its factorization.
1110113113111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 16.
Adding to 1110113113111 its reverse (1113113110111), we get a palindrome (2223226223222).
The spelling of 1110113113111 in words is "one trillion, one hundred ten billion, one hundred thirteen million, one hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •