Base | Representation |
---|---|
bin | 1111000101101000101000… |
… | …1110000001100000011101 |
3 | 2011201221100120100001201002 |
4 | 3301122022032001200131 |
5 | 4133300230023113044 |
6 | 55141034134400045 |
7 | 3331356562465643 |
oct | 361321216014035 |
9 | 64657316301632 |
10 | 16589482629149 |
11 | 5316618503641 |
12 | 1a3b1a0200025 |
13 | 9344c6200751 |
14 | 414d14445193 |
15 | 1db7e574074e |
hex | f168a38181d |
16589482629149 has 2 divisors, whose sum is σ = 16589482629150. Its totient is φ = 16589482629148.
The previous prime is 16589482629043. The next prime is 16589482629151. The reversal of 16589482629149 is 94192628498561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14006358645049 + 2583123984100 = 3742507^2 + 1607210^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16589482629149 is a prime.
Together with 16589482629151, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16589482629449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8294741314574 + 8294741314575.
It is an arithmetic number, because the mean of its divisors is an integer number (8294741314575).
Almost surely, 216589482629149 is an apocalyptic number.
It is an amenable number.
16589482629149 is a deficient number, since it is larger than the sum of its proper divisors (1).
16589482629149 is an equidigital number, since it uses as much as digits as its factorization.
16589482629149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 537477120, while the sum is 74.
The spelling of 16589482629149 in words is "sixteen trillion, five hundred eighty-nine billion, four hundred eighty-two million, six hundred twenty-nine thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •