Base | Representation |
---|---|
bin | 11001001111011010000111… |
… | …101011010001011001001001 |
3 | 112120001110012211121122110212 |
4 | 121033122013223101121021 |
5 | 104022241440224000014 |
6 | 1032033142422250505 |
7 | 32245131211414166 |
oct | 3117320753213111 |
9 | 476043184548425 |
10 | 111010001000009 |
11 | 3240a0935a3451 |
12 | 1054a594886a35 |
13 | 49c3276517687 |
14 | 1d5acac6cb06d |
15 | cc7958e8323e |
hex | 64f687ad1649 |
111010001000009 has 2 divisors, whose sum is σ = 111010001000010. Its totient is φ = 111010001000008.
The previous prime is 111010000999999. The next prime is 111010001000011. The reversal of 111010001000009 is 900000100010111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108171544308025 + 2838456691984 = 10400555^2 + 1684772^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111010001000009 is a prime.
Together with 111010001000011, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 111010000999957 and 111010001000002.
It is not a weakly prime, because it can be changed into another prime (111010001000029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505000500004 + 55505000500005.
It is an arithmetic number, because the mean of its divisors is an integer number (55505000500005).
Almost surely, 2111010001000009 is an apocalyptic number.
It is an amenable number.
111010001000009 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010001000009 is an equidigital number, since it uses as much as digits as its factorization.
111010001000009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 111010001000009 in words is "one hundred eleven trillion, ten billion, one million, nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •