Base | Representation |
---|---|
bin | 11001001111010001101111… |
… | …001111011010100111111001 |
3 | 112120000120222121201212100121 |
4 | 121033101233033122213321 |
5 | 104022120022241010014 |
6 | 1032025053403333241 |
7 | 32244362166541633 |
oct | 3117215717324771 |
9 | 476016877655317 |
10 | 111001001110009 |
11 | 3240629537792a |
12 | 105488a2821221 |
13 | 49c2470aa548a |
14 | 1d5a697303a53 |
15 | cc75cdcc9124 |
hex | 64f46f3da9f9 |
111001001110009 has 2 divisors, whose sum is σ = 111001001110010. Its totient is φ = 111001001110008.
The previous prime is 111001001110003. The next prime is 111001001110067. The reversal of 111001001110009 is 900011100100111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108850827585600 + 2150173524409 = 10433160^2 + 1466347^2 .
It is a cyclic number.
It is not a de Polignac number, because 111001001110009 - 233 = 110992411175417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111001001109974 and 111001001110001.
It is not a weakly prime, because it can be changed into another prime (111001001110003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55500500555004 + 55500500555005.
It is an arithmetic number, because the mean of its divisors is an integer number (55500500555005).
Almost surely, 2111001001110009 is an apocalyptic number.
It is an amenable number.
111001001110009 is a deficient number, since it is larger than the sum of its proper divisors (1).
111001001110009 is an equidigital number, since it uses as much as digits as its factorization.
111001001110009 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.
The spelling of 111001001110009 in words is "one hundred eleven trillion, one billion, one million, one hundred ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •