Base | Representation |
---|---|
bin | 1110101101110001100… |
… | …00111001110010110001 |
3 | 1210100001220022002121201 |
4 | 13112320300321302301 |
5 | 31240442404013014 |
6 | 1024135142251201 |
7 | 51346340412022 |
oct | 7267060716261 |
9 | 1710056262551 |
10 | 505611001009 |
11 | 185479257614 |
12 | 81ba8126b01 |
13 | 388a975760a |
14 | 1a6864d2c49 |
15 | d24352be74 |
hex | 75b8c39cb1 |
505611001009 has 2 divisors, whose sum is σ = 505611001010. Its totient is φ = 505611001008.
The previous prime is 505611000949. The next prime is 505611001111. The reversal of 505611001009 is 900100116505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 489979000225 + 15632000784 = 699985^2 + 125028^2 .
It is a cyclic number.
It is not a de Polignac number, because 505611001009 - 215 = 505610968241 is a prime.
It is not a weakly prime, because it can be changed into another prime (505611002009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252805500504 + 252805500505.
It is an arithmetic number, because the mean of its divisors is an integer number (252805500505).
Almost surely, 2505611001009 is an apocalyptic number.
It is an amenable number.
505611001009 is a deficient number, since it is larger than the sum of its proper divisors (1).
505611001009 is an equidigital number, since it uses as much as digits as its factorization.
505611001009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 28.
The spelling of 505611001009 in words is "five hundred five billion, six hundred eleven million, one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •