Base | Representation |
---|---|
bin | 11101001111001010101… |
… | …111001111010111101101 |
3 | 21010001222012021022222211 |
4 | 131033022233033113231 |
5 | 230404220140433324 |
6 | 4134554041010421 |
7 | 265104431433652 |
oct | 35171257172755 |
9 | 7101865238884 |
10 | 2009151108589 |
11 | 705092471149 |
12 | 285478783a11 |
13 | 117601411021 |
14 | 6d359d9bc29 |
15 | 373e15a7294 |
hex | 1d3cabcf5ed |
2009151108589 has 2 divisors, whose sum is σ = 2009151108590. Its totient is φ = 2009151108588.
The previous prime is 2009151108577. The next prime is 2009151108611. The reversal of 2009151108589 is 9858011519002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1887691888489 + 121459220100 = 1373933^2 + 348510^2 .
It is a cyclic number.
It is not a de Polignac number, because 2009151108589 - 223 = 2009142719981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2009151108539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1004575554294 + 1004575554295.
It is an arithmetic number, because the mean of its divisors is an integer number (1004575554295).
Almost surely, 22009151108589 is an apocalyptic number.
It is an amenable number.
2009151108589 is a deficient number, since it is larger than the sum of its proper divisors (1).
2009151108589 is an equidigital number, since it uses as much as digits as its factorization.
2009151108589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 49.
The spelling of 2009151108589 in words is "two trillion, nine billion, one hundred fifty-one million, one hundred eight thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •