Base | Representation |
---|---|
bin | 10010011111110… |
… | …01010110111001 |
3 | 101210222001022021 |
4 | 21033321112321 |
5 | 304210141131 |
6 | 23221354441 |
7 | 3562566316 |
oct | 1117712671 |
9 | 353861267 |
10 | 155162041 |
11 | 7a6485a1 |
12 | 43b68a21 |
13 | 261b8678 |
14 | 1686dd0d |
15 | d94de11 |
hex | 93f95b9 |
155162041 has 2 divisors, whose sum is σ = 155162042. Its totient is φ = 155162040.
The previous prime is 155162039. The next prime is 155162089. The reversal of 155162041 is 140261551.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102090816 + 53071225 = 10104^2 + 7285^2 .
It is an emirp because it is prime and its reverse (140261551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 155162041 - 21 = 155162039 is a prime.
Together with 155162039, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 155161997 and 155162015.
It is not a weakly prime, because it can be changed into another prime (155162141) 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, 77581020 + 77581021.
It is an arithmetic number, because the mean of its divisors is an integer number (77581021).
Almost surely, 2155162041 is an apocalyptic number.
It is an amenable number.
155162041 is a deficient number, since it is larger than the sum of its proper divisors (1).
155162041 is an equidigital number, since it uses as much as digits as its factorization.
155162041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 25.
The square root of 155162041 is about 12456.4056212055. The cubic root of 155162041 is about 537.3556602511.
The spelling of 155162041 in words is "one hundred fifty-five million, one hundred sixty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •