Base | Representation |
---|---|
bin | 10000110100000010100… |
… | …010000011110011110101 |
3 | 11002110021000122112021011 |
4 | 100310002202003303311 |
5 | 122412214000414212 |
6 | 2242440033152221 |
7 | 146321415533551 |
oct | 20640242036365 |
9 | 4073230575234 |
10 | 1155388685557 |
11 | 405aa7879287 |
12 | 167b093bb671 |
13 | 84c50086222 |
14 | 3dcc7756861 |
15 | 200c34784a7 |
hex | 10d02883cf5 |
1155388685557 has 2 divisors, whose sum is σ = 1155388685558. Its totient is φ = 1155388685556.
The previous prime is 1155388685551. The next prime is 1155388685573. The reversal of 1155388685557 is 7555868835511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1144983461521 + 10405224036 = 1070039^2 + 102006^2 .
It is a cyclic number.
It is not a de Polignac number, because 1155388685557 - 223 = 1155380296949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1155388685492 and 1155388685501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1155388685551) 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, 577694342778 + 577694342779.
It is an arithmetic number, because the mean of its divisors is an integer number (577694342779).
Almost surely, 21155388685557 is an apocalyptic number.
It is an amenable number.
1155388685557 is a deficient number, since it is larger than the sum of its proper divisors (1).
1155388685557 is an equidigital number, since it uses as much as digits as its factorization.
1155388685557 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 201600000, while the sum is 67.
The spelling of 1155388685557 in words is "one trillion, one hundred fifty-five billion, three hundred eighty-eight million, six hundred eighty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •