Base | Representation |
---|---|
bin | 111110111011100100101110… |
… | …1010010010000101010001101 |
3 | 2200120221102210102222020022101 |
4 | 1331313021131102100222031 |
5 | 1040023242231232022424 |
6 | 5241143151024315101 |
7 | 224411226340314406 |
oct | 17567113522205215 |
9 | 2616842712866271 |
10 | 553545540110989 |
11 | 150416388543498 |
12 | 52100a01472a91 |
13 | 1a9b4174832a5a |
14 | 9a99a660469ad |
15 | 43edeca961344 |
hex | 1f7725d490a8d |
553545540110989 has 2 divisors, whose sum is σ = 553545540110990. Its totient is φ = 553545540110988.
The previous prime is 553545540110911. The next prime is 553545540111071. The reversal of 553545540110989 is 989011045545355.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 298255766826889 + 255289773284100 = 17270083^2 + 15977790^2 .
It is a cyclic number.
It is not a de Polignac number, because 553545540110989 - 231 = 553543392627341 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 553545540110989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (553545540117989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276772770055494 + 276772770055495.
It is an arithmetic number, because the mean of its divisors is an integer number (276772770055495).
Almost surely, 2553545540110989 is an apocalyptic number.
It is an amenable number.
553545540110989 is a deficient number, since it is larger than the sum of its proper divisors (1).
553545540110989 is an equidigital number, since it uses as much as digits as its factorization.
553545540110989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 97200000, while the sum is 64.
The spelling of 553545540110989 in words is "five hundred fifty-three trillion, five hundred forty-five billion, five hundred forty million, one hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •