Base | Representation |
---|---|
bin | 1010000000110101101111… |
… | …0100000101000001010111 |
3 | 1102222111112212210001201202 |
4 | 2200031123310011001113 |
5 | 2420340020114331414 |
6 | 35225414044143115 |
7 | 2214261463116611 |
oct | 240153364050127 |
9 | 42874485701652 |
10 | 11009541558359 |
11 | 3565136211a33 |
12 | 1299881237a9b |
13 | 61b27014a386 |
14 | 2a0c1687ddb1 |
15 | 1415b41ac9de |
hex | a035bd05057 |
11009541558359 has 2 divisors, whose sum is σ = 11009541558360. Its totient is φ = 11009541558358.
The previous prime is 11009541558283. The next prime is 11009541558391. The reversal of 11009541558359 is 95385514590011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11009541558359 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11009541558859) 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, 5504770779179 + 5504770779180.
It is an arithmetic number, because the mean of its divisors is an integer number (5504770779180).
Almost surely, 211009541558359 is an apocalyptic number.
11009541558359 is a deficient number, since it is larger than the sum of its proper divisors (1).
11009541558359 is an equidigital number, since it uses as much as digits as its factorization.
11009541558359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860000, while the sum is 56.
The spelling of 11009541558359 in words is "eleven trillion, nine billion, five hundred forty-one million, five hundred fifty-eight thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •