Base | Representation |
---|---|
bin | 10010011111101… |
… | …01000010000011 |
3 | 101210221011000001 |
4 | 21033311002003 |
5 | 304204104243 |
6 | 23221140431 |
7 | 3562463545 |
oct | 1117650203 |
9 | 353834001 |
10 | 155144323 |
11 | 7a636254 |
12 | 43b5a717 |
13 | 261b0599 |
14 | 16867695 |
15 | d948a4d |
hex | 93f5083 |
155144323 has 2 divisors, whose sum is σ = 155144324. Its totient is φ = 155144322.
The previous prime is 155144273. The next prime is 155144351. The reversal of 155144323 is 323441551.
It is an a-pointer prime, because the next prime (155144351) can be obtained adding 155144323 to its sum of digits (28).
It is a strong prime.
It is an emirp because it is prime and its reverse (323441551) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-155144323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 155144291 and 155144300.
It is not a weakly prime, because it can be changed into another prime (155144393) 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 as a sum of consecutive naturals, namely, 77572161 + 77572162.
It is an arithmetic number, because the mean of its divisors is an integer number (77572162).
Almost surely, 2155144323 is an apocalyptic number.
155144323 is a deficient number, since it is larger than the sum of its proper divisors (1).
155144323 is an equidigital number, since it uses as much as digits as its factorization.
155144323 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7200, while the sum is 28.
The square root of 155144323 is about 12455.6944005543. The cubic root of 155144323 is about 537.3352058712.
Adding to 155144323 its reverse (323441551), we get a palindrome (478585874).
The spelling of 155144323 in words is "one hundred fifty-five million, one hundred forty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •