Base | Representation |
---|---|
bin | 11001011101101011110110… |
… | …011001101010100110000111 |
3 | 112200112020122002112202120102 |
4 | 121131223312121222212013 |
5 | 104134330243431332421 |
6 | 1034104001202554315 |
7 | 32406043064461334 |
oct | 3135536631524607 |
9 | 480466562482512 |
10 | 111991111199111 |
11 | 32758188740341 |
12 | 1068876466899b |
13 | 4a6494111a621 |
14 | 1d9258208398b |
15 | ce322c17b60b |
hex | 65daf666a987 |
111991111199111 has 2 divisors, whose sum is σ = 111991111199112. Its totient is φ = 111991111199110.
The previous prime is 111991111199081. The next prime is 111991111199137.
111991111199111 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 111991111199111 - 26 = 111991111199047 is a prime.
It is a super-2 number, since 2×1119911111991112 (a number of 29 digits) contains 22 as substring.
It is a zygodrome in base 10.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111991111199141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55995555599555 + 55995555599556.
It is an arithmetic number, because the mean of its divisors is an integer number (55995555599556).
Almost surely, 2111991111199111 is an apocalyptic number.
111991111199111 is a deficient number, since it is larger than the sum of its proper divisors (1).
111991111199111 is an equidigital number, since it uses as much as digits as its factorization.
111991111199111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6561, while the sum is 47.
The spelling of 111991111199111 in words is "one hundred eleven trillion, nine hundred ninety-one billion, one hundred eleven million, one hundred ninety-nine thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •