Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …111101100011011100101 |
3 | 10220011120122120002000122 |
4 | 100000203233230123211 |
5 | 121011012000124333 |
6 | 2201214551451325 |
7 | 142323533020553 |
oct | 20004357543345 |
9 | 3804518502018 |
10 | 1100111333093 |
11 | 394611193213 |
12 | 159261086b45 |
13 | 7c980b89346 |
14 | 3b3621a8bd3 |
15 | 1d93a643798 |
hex | 10023bec6e5 |
1100111333093 has 2 divisors, whose sum is σ = 1100111333094. Its totient is φ = 1100111333092.
The previous prime is 1100111333077. The next prime is 1100111333119. The reversal of 1100111333093 is 3903331110011.
It is an a-pointer prime, because the next prime (1100111333119) can be obtained adding 1100111333093 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 613099962049 + 487011371044 = 783007^2 + 697862^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100111333093 - 24 = 1100111333077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100111333003) 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, 550055666546 + 550055666547.
It is an arithmetic number, because the mean of its divisors is an integer number (550055666547).
Almost surely, 21100111333093 is an apocalyptic number.
It is an amenable number.
1100111333093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100111333093 is an equidigital number, since it uses as much as digits as its factorization.
1100111333093 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 26.
The spelling of 1100111333093 in words is "one trillion, one hundred billion, one hundred eleven million, three hundred thirty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •