Base | Representation |
---|---|
bin | 10010111000100… |
… | …00111000101101 |
3 | 102001001202122001 |
4 | 21130100320231 |
5 | 311022413031 |
6 | 23415052301 |
7 | 3632261440 |
oct | 1134207055 |
9 | 361052561 |
10 | 158404141 |
11 | 81462415 |
12 | 45071091 |
13 | 26a8227c |
14 | 17075657 |
15 | dd8e861 |
hex | 9710e2d |
158404141 has 32 divisors (see below), whose sum is σ = 194754560. Its totient is φ = 125971200.
The previous prime is 158404133. The next prime is 158404153. The reversal of 158404141 is 141404851.
It is a 4-Lehmer number, since φ(158404141) divides (158404141-1)4.
It is a cyclic number.
It is a Carmichael number.
It is not a de Polignac number, because 158404141 - 23 = 158404133 is a prime.
It is a deceptive number, since it divides R158404140.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (158405141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 875071 + ... + 875251.
It is an arithmetic number, because the mean of its divisors is an integer number (6086080).
It is a Poulet number, since it divides 2158404140-1.
Almost surely, 2158404141 is an apocalyptic number.
It is an amenable number.
158404141 is a deficient number, since it is larger than the sum of its proper divisors (36350419).
158404141 is a wasteful number, since it uses less digits than its factorization.
158404141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365.
The product of its (nonzero) digits is 2560, while the sum is 28.
The square root of 158404141 is about 12585.8706889909. The cubic root of 158404141 is about 541.0725607452.
Adding to 158404141 its reverse (141404851), we get a palindrome (299808992).
The spelling of 158404141 in words is "one hundred fifty-eight million, four hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •