Base | Representation |
---|---|
bin | 10000010100111100100… |
… | …01011000011001101001 |
3 | 1222122001010112220212202 |
4 | 20022132101120121221 |
5 | 33142412240330001 |
6 | 1105415332345545 |
7 | 55350062466461 |
oct | 10123621303151 |
9 | 1878033486782 |
10 | 561001105001 |
11 | 1a6a12553567 |
12 | 908861752b5 |
13 | 40b9611108c |
14 | 1d21ca30ba1 |
15 | e8d61d496b |
hex | 829e458669 |
561001105001 has 2 divisors, whose sum is σ = 561001105002. Its totient is φ = 561001105000.
The previous prime is 561001104997. The next prime is 561001105057. The reversal of 561001105001 is 100501100165.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 284510226025 + 276490878976 = 533395^2 + 525824^2 .
It is a cyclic number.
It is not a de Polignac number, because 561001105001 - 22 = 561001104997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (561001105081) 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, 280500552500 + 280500552501.
It is an arithmetic number, because the mean of its divisors is an integer number (280500552501).
Almost surely, 2561001105001 is an apocalyptic number.
It is an amenable number.
561001105001 is a deficient number, since it is larger than the sum of its proper divisors (1).
561001105001 is an equidigital number, since it uses as much as digits as its factorization.
561001105001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 561001105001 its reverse (100501100165), we get a palindrome (661502205166).
The spelling of 561001105001 in words is "five hundred sixty-one billion, one million, one hundred five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •