Base | Representation |
---|---|
bin | 10010111111011… |
… | …10110011110101 |
3 | 102002202221112201 |
4 | 21133232303311 |
5 | 311241010031 |
6 | 23450344501 |
7 | 3643065541 |
oct | 1137566365 |
9 | 362687481 |
10 | 159313141 |
11 | 81a23359 |
12 | 4542b131 |
13 | 2700cc40 |
14 | 17230a21 |
15 | debdd61 |
hex | 97eecf5 |
159313141 has 4 divisors (see below), whose sum is σ = 171568012. Its totient is φ = 147058272.
The previous prime is 159313117. The next prime is 159313169. The reversal of 159313141 is 141313951.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141313951 = 853 ⋅165667.
It can be written as a sum of positive squares in 2 ways, for example, as 44609041 + 114704100 = 6679^2 + 10710^2 .
It is a cyclic number.
It is not a de Polignac number, because 159313141 - 25 = 159313109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (159319141) 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 in 3 ways as a sum of consecutive naturals, for example, 6127416 + ... + 6127441.
It is an arithmetic number, because the mean of its divisors is an integer number (42892003).
Almost surely, 2159313141 is an apocalyptic number.
It is an amenable number.
159313141 is a deficient number, since it is larger than the sum of its proper divisors (12254871).
159313141 is a wasteful number, since it uses less digits than its factorization.
159313141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12254870.
The product of its digits is 1620, while the sum is 28.
The square root of 159313141 is about 12621.9309537012. The cubic root of 159313141 is about 542.1055664618.
The spelling of 159313141 in words is "one hundred fifty-nine million, three hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •