Base | Representation |
---|---|
bin | 10010100000111… |
… | …10100000110111 |
3 | 101211020210001221 |
4 | 21100132200313 |
5 | 304230023411 |
6 | 23224531211 |
7 | 3564102112 |
oct | 1120364067 |
9 | 354223057 |
10 | 155314231 |
11 | 7a741976 |
12 | 44020b07 |
13 | 2623ca17 |
14 | 168ad579 |
15 | d97e071 |
hex | 941e837 |
155314231 has 2 divisors, whose sum is σ = 155314232. Its totient is φ = 155314230.
The previous prime is 155314223. The next prime is 155314253. The reversal of 155314231 is 132413551.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (132413551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 155314231 - 23 = 155314223 is a prime.
It is a super-2 number, since 2×1553142312 = 48245020702242722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155314196 and 155314205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155314631) 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, 77657115 + 77657116.
It is an arithmetic number, because the mean of its divisors is an integer number (77657116).
Almost surely, 2155314231 is an apocalyptic number.
155314231 is a deficient number, since it is larger than the sum of its proper divisors (1).
155314231 is an equidigital number, since it uses as much as digits as its factorization.
155314231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1800, while the sum is 25.
The square root of 155314231 is about 12462.5130290805. The cubic root of 155314231 is about 537.5312904805.
Adding to 155314231 its reverse (132413551), we get a palindrome (287727782).
The spelling of 155314231 in words is "one hundred fifty-five million, three hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •