Base | Representation |
---|---|
bin | 10011000100000… |
… | …00010101101101 |
3 | 102010220020020001 |
4 | 21202000111231 |
5 | 311414043404 |
6 | 23511224301 |
7 | 3651130444 |
oct | 1142002555 |
9 | 363806201 |
10 | 159909229 |
11 | 822a0197 |
12 | 45678091 |
13 | 2718b35c |
14 | 17347d5b |
15 | e08a7a4 |
hex | 988056d |
159909229 has 2 divisors, whose sum is σ = 159909230. Its totient is φ = 159909228.
The previous prime is 159909223. The next prime is 159909257. The reversal of 159909229 is 922909951.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 150921225 + 8988004 = 12285^2 + 2998^2 .
It is a cyclic number.
It is not a de Polignac number, because 159909229 - 29 = 159908717 is a prime.
It is a Chen prime.
It is equal to p8969644 and since 159909229 and 8969644 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (159909223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79954614 + 79954615.
It is an arithmetic number, because the mean of its divisors is an integer number (79954615).
Almost surely, 2159909229 is an apocalyptic number.
It is an amenable number.
159909229 is a deficient number, since it is larger than the sum of its proper divisors (1).
159909229 is an equidigital number, since it uses as much as digits as its factorization.
159909229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131220, while the sum is 46.
The square root of 159909229 is about 12645.5220928201. The cubic root of 159909229 is about 542.7808412314.
The spelling of 159909229 in words is "one hundred fifty-nine million, nine hundred nine thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •