Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …010111101011010000101 |
3 | 10220011120120020000102212 |
4 | 100000203222331122011 |
5 | 121011011140420114 |
6 | 2201214505113205 |
7 | 142323516331133 |
oct | 20004352753205 |
9 | 3804516200385 |
10 | 1100110091909 |
11 | 394610515744 |
12 | 159260788805 |
13 | 7c98084340a |
14 | 3b361d64753 |
15 | 1d93a49ab3e |
hex | 10023abd685 |
1100110091909 has 2 divisors, whose sum is σ = 1100110091910. Its totient is φ = 1100110091908.
The previous prime is 1100110091881. The next prime is 1100110091917. The reversal of 1100110091909 is 9091900110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 990777362884 + 109332729025 = 995378^2 + 330655^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100110091909 - 216 = 1100110026373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100110091939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055045954 + 550055045955.
It is an arithmetic number, because the mean of its divisors is an integer number (550055045955).
Almost surely, 21100110091909 is an apocalyptic number.
It is an amenable number.
1100110091909 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100110091909 is an equidigital number, since it uses as much as digits as its factorization.
1100110091909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 32.
The spelling of 1100110091909 in words is "one trillion, one hundred billion, one hundred ten million, ninety-one thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •