Base | Representation |
---|---|
bin | 11001001111011100001010… |
… | …110100000001101001100111 |
3 | 112120001122220011111211011111 |
4 | 121033130022310001221213 |
5 | 104022310441441010434 |
6 | 1032034145014245451 |
7 | 32245236555142321 |
oct | 3117341264015147 |
9 | 476048804454144 |
10 | 111012201110119 |
11 | 32410012498771 |
12 | 1054aaa9656887 |
13 | 49c353728718a |
14 | 1d5b03a996611 |
15 | cc7a371c2964 |
hex | 64f70ad01a67 |
111012201110119 has 2 divisors, whose sum is σ = 111012201110120. Its totient is φ = 111012201110118.
The previous prime is 111012201110039. The next prime is 111012201110149. The reversal of 111012201110119 is 911011102210111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111012201110119 - 27 = 111012201109991 is a prime.
It is a super-2 number, since 2×1110122011101192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111012201110119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111012201110149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55506100555059 + 55506100555060.
It is an arithmetic number, because the mean of its divisors is an integer number (55506100555060).
Almost surely, 2111012201110119 is an apocalyptic number.
111012201110119 is a deficient number, since it is larger than the sum of its proper divisors (1).
111012201110119 is an equidigital number, since it uses as much as digits as its factorization.
111012201110119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 22.
The spelling of 111012201110119 in words is "one hundred eleven trillion, twelve billion, two hundred one million, one hundred ten thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •