Base | Representation |
---|---|
bin | 10010111101011… |
… | …00111111001001 |
3 | 102002021020201002 |
4 | 21132230333021 |
5 | 311203343104 |
6 | 23440504345 |
7 | 3640563521 |
oct | 1136547711 |
9 | 362236632 |
10 | 159043529 |
11 | 81859837 |
12 | 4531b0b5 |
13 | 26c472c8 |
14 | 171a0681 |
15 | de6901e |
hex | 97acfc9 |
159043529 has 2 divisors, whose sum is σ = 159043530. Its totient is φ = 159043528.
The previous prime is 159043481. The next prime is 159043537. The reversal of 159043529 is 925340951.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150013504 + 9030025 = 12248^2 + 3005^2 .
It is a cyclic number.
It is not a de Polignac number, because 159043529 - 220 = 157994953 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 159043492 and 159043501.
It is not a weakly prime, because it can be changed into another prime (159043579) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79521764 + 79521765.
It is an arithmetic number, because the mean of its divisors is an integer number (79521765).
Almost surely, 2159043529 is an apocalyptic number.
It is an amenable number.
159043529 is a deficient number, since it is larger than the sum of its proper divisors (1).
159043529 is an equidigital number, since it uses as much as digits as its factorization.
159043529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 38.
The square root of 159043529 is about 12611.2461319253. The cubic root of 159043529 is about 541.7995848115.
The spelling of 159043529 in words is "one hundred fifty-nine million, forty-three thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •