Base | Representation |
---|---|
bin | 10000001001110111000… |
… | …111011110010000011001 |
3 | 10221010100210000102210112 |
4 | 100021313013132100121 |
5 | 121141441100310014 |
6 | 2205550051454105 |
7 | 143126212252604 |
oct | 20116707362031 |
9 | 3833323012715 |
10 | 1110100010009 |
11 | 398877574001 |
12 | 15b18a2b7335 |
13 | 808b3410963 |
14 | 3ba2ca2133b |
15 | 1dd2251673e |
hex | 102771de419 |
1110100010009 has 2 divisors, whose sum is σ = 1110100010010. Its totient is φ = 1110100010008.
The previous prime is 1110100009969. The next prime is 1110100010011. The reversal of 1110100010009 is 9000100010111.
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., 1089894240400 + 20205769609 = 1043980^2 + 142147^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110100010009 is a prime.
Together with 1110100010011, 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 = 1110100009975 and 1110100010002.
It is not a weakly prime, because it can be changed into another prime (1110100010059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555050005004 + 555050005005.
It is an arithmetic number, because the mean of its divisors is an integer number (555050005005).
Almost surely, 21110100010009 is an apocalyptic number.
It is an amenable number.
1110100010009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110100010009 is an equidigital number, since it uses as much as digits as its factorization.
1110100010009 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 14.
The spelling of 1110100010009 in words is "one trillion, one hundred ten billion, one hundred million, ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •