Base | Representation |
---|---|
bin | 100001011110011… |
… | …000010101000101 |
3 | 1110010202211222012 |
4 | 201132120111011 |
5 | 2122233041401 |
6 | 131421144005 |
7 | 16626424031 |
oct | 4136302505 |
9 | 1403684865 |
10 | 561612101 |
11 | 269019536 |
12 | 1380bb005 |
13 | 8c477a6b |
14 | 548331c1 |
15 | 344888bb |
hex | 21798545 |
561612101 has 2 divisors, whose sum is σ = 561612102. Its totient is φ = 561612100.
The previous prime is 561612067. The next prime is 561612109. The reversal of 561612101 is 101216165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 503104900 + 58507201 = 22430^2 + 7649^2 .
It is a cyclic number.
It is not a de Polignac number, because 561612101 - 210 = 561611077 is a prime.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a plaindrome in base 15.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (561612109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 280806050 + 280806051.
It is an arithmetic number, because the mean of its divisors is an integer number (280806051).
Almost surely, 2561612101 is an apocalyptic number.
It is an amenable number.
561612101 is a deficient number, since it is larger than the sum of its proper divisors (1).
561612101 is an equidigital number, since it uses as much as digits as its factorization.
561612101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
The square root of 561612101 is about 23698.3565041967. The cubic root of 561612101 is about 825.0472460240.
Adding to 561612101 its reverse (101216165), we get a palindrome (662828266).
The spelling of 561612101 in words is "five hundred sixty-one million, six hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •