Base | Representation |
---|---|
bin | 10000000101101011011… |
… | …001010111111101101101 |
3 | 10220200202202021110110102 |
4 | 100011223121113331231 |
5 | 121103241223041231 |
6 | 2203524241120445 |
7 | 142610002263011 |
oct | 20055331277555 |
9 | 3820682243412 |
10 | 1105608408941 |
11 | 39698213a703 |
12 | 15a336029125 |
13 | 803489b804a |
14 | 3b7242a0541 |
15 | 1db5d036acb |
hex | 1016b657f6d |
1105608408941 has 2 divisors, whose sum is σ = 1105608408942. Its totient is φ = 1105608408940.
The previous prime is 1105608408923. The next prime is 1105608408967. The reversal of 1105608408941 is 1498048065011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 890918893225 + 214689515716 = 943885^2 + 463346^2 .
It is an emirp because it is prime and its reverse (1498048065011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1105608408941 - 214 = 1105608392557 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105608408911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552804204470 + 552804204471.
It is an arithmetic number, because the mean of its divisors is an integer number (552804204471).
Almost surely, 21105608408941 is an apocalyptic number.
It is an amenable number.
1105608408941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105608408941 is an equidigital number, since it uses as much as digits as its factorization.
1105608408941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 47.
The spelling of 1105608408941 in words is "one trillion, one hundred five billion, six hundred eight million, four hundred eight thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •