Base | Representation |
---|---|
bin | 10000010001100000001… |
… | …10001111001111010101 |
3 | 1222110021022102201100211 |
4 | 20020300012033033111 |
5 | 33130121042041013 |
6 | 1104512102405421 |
7 | 55253216306032 |
oct | 10106006171725 |
9 | 1873238381324 |
10 | 559152690133 |
11 | 1a6154131074 |
12 | 9044b130871 |
13 | 4096019c27b |
14 | 1d0c5354389 |
15 | e828cb623d |
hex | 823018f3d5 |
559152690133 has 2 divisors, whose sum is σ = 559152690134. Its totient is φ = 559152690132.
The previous prime is 559152690091. The next prime is 559152690179. The reversal of 559152690133 is 331096251955.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 545082460209 + 14070229924 = 738297^2 + 118618^2 .
It is a cyclic number.
It is not a de Polignac number, because 559152690133 - 29 = 559152689621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (559152697133) 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, 279576345066 + 279576345067.
It is an arithmetic number, because the mean of its divisors is an integer number (279576345067).
Almost surely, 2559152690133 is an apocalyptic number.
It is an amenable number.
559152690133 is a deficient number, since it is larger than the sum of its proper divisors (1).
559152690133 is an equidigital number, since it uses as much as digits as its factorization.
559152690133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1093500, while the sum is 49.
The spelling of 559152690133 in words is "five hundred fifty-nine billion, one hundred fifty-two million, six hundred ninety thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •