Base | Representation |
---|---|
bin | 110011101111010111… |
… | …1001101011000001111 |
3 | 101121210112010200220221 |
4 | 1213132233031120033 |
5 | 3310023420144134 |
6 | 123013240252211 |
7 | 11012302523551 |
oct | 1473657153017 |
9 | 347715120827 |
10 | 111111099919 |
11 | 43138356a06 |
12 | 1964aa71067 |
13 | a629765c91 |
14 | 55409b14d1 |
15 | 2d549225b4 |
hex | 19debcd60f |
111111099919 has 2 divisors, whose sum is σ = 111111099920. Its totient is φ = 111111099918.
The previous prime is 111111099917. The next prime is 111111099971. The reversal of 111111099919 is 919990111111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111111099919 - 21 = 111111099917 is a prime.
It is a super-2 number, since 2×1111110999192 (a number of 23 digits) contains 22 as substring.
Together with 111111099917, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111111099917) 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, 55555549959 + 55555549960.
It is an arithmetic number, because the mean of its divisors is an integer number (55555549960).
Almost surely, 2111111099919 is an apocalyptic number.
111111099919 is a deficient number, since it is larger than the sum of its proper divisors (1).
111111099919 is an equidigital number, since it uses as much as digits as its factorization.
111111099919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 43.
The spelling of 111111099919 in words is "one hundred eleven billion, one hundred eleven million, ninety-nine thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •