Base | Representation |
---|---|
bin | 1010010011100011100110… |
… | …0100011000011110001101 |
3 | 1111010020112010002021102102 |
4 | 2210320321210120132031 |
5 | 2441122032412044311 |
6 | 40033233010004445 |
7 | 2246433651101612 |
oct | 244707144303615 |
9 | 44106463067372 |
10 | 11331089565581 |
11 | 3679540727a65 |
12 | 133005ab76725 |
13 | 6426952841c6 |
14 | 2b25db706509 |
15 | 149b3346643b |
hex | a4e3991878d |
11331089565581 has 2 divisors, whose sum is σ = 11331089565582. Its totient is φ = 11331089565580.
The previous prime is 11331089565577. The next prime is 11331089565617. The reversal of 11331089565581 is 18556598013311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8222321116681 + 3108768448900 = 2867459^2 + 1763170^2 .
It is an emirp because it is prime and its reverse (18556598013311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11331089565581 - 22 = 11331089565577 is a prime.
It is a super-2 number, since 2×113310895655812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331289565581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665544782790 + 5665544782791.
It is an arithmetic number, because the mean of its divisors is an integer number (5665544782791).
Almost surely, 211331089565581 is an apocalyptic number.
It is an amenable number.
11331089565581 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331089565581 is an equidigital number, since it uses as much as digits as its factorization.
11331089565581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888000, while the sum is 56.
The spelling of 11331089565581 in words is "eleven trillion, three hundred thirty-one billion, eighty-nine million, five hundred sixty-five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •