Base | Representation |
---|---|
bin | 10011000100000… |
… | …00110011011001 |
3 | 102010220022211102 |
4 | 21202000303121 |
5 | 311414124004 |
6 | 23511241145 |
7 | 3651136130 |
oct | 1142006331 |
9 | 363808742 |
10 | 159911129 |
11 | 822a1664 |
12 | 456791b5 |
13 | 2718c191 |
14 | 17348917 |
15 | e08b11e |
hex | 9880cd9 |
159911129 has 8 divisors (see below), whose sum is σ = 193506048. Its totient is φ = 129003840.
The previous prime is 159911119. The next prime is 159911153. The reversal of 159911129 is 921119951.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-159911129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 159911092 and 159911101.
It is not an unprimeable number, because it can be changed into a prime (159911119) 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 in 7 ways as a sum of consecutive naturals, for example, 671777 + ... + 672014.
It is an arithmetic number, because the mean of its divisors is an integer number (24188256).
Almost surely, 2159911129 is an apocalyptic number.
It is an amenable number.
159911129 is a deficient number, since it is larger than the sum of its proper divisors (33594919).
159911129 is a wasteful number, since it uses less digits than its factorization.
159911129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343815.
The product of its digits is 7290, while the sum is 38.
The square root of 159911129 is about 12645.5972180044. The cubic root of 159911129 is about 542.7829909500.
The spelling of 159911129 in words is "one hundred fifty-nine million, nine hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •