Base | Representation |
---|---|
bin | 10010100001010… |
… | …00110100101001 |
3 | 101211022220222212 |
4 | 21100220310221 |
5 | 304232401312 |
6 | 23225454505 |
7 | 3564336164 |
oct | 1120506451 |
9 | 354286885 |
10 | 155356457 |
11 | 7a770673 |
12 | 44041435 |
13 | 26255cc9 |
14 | 168c0adb |
15 | d98b822 |
hex | 9428d29 |
155356457 has 2 divisors, whose sum is σ = 155356458. Its totient is φ = 155356456.
The previous prime is 155356417. The next prime is 155356459. The reversal of 155356457 is 754653551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122855056 + 32501401 = 11084^2 + 5701^2 .
It is an emirp because it is prime and its reverse (754653551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 155356457 - 222 = 151162153 is a prime.
Together with 155356459, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (155356459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77678228 + 77678229.
It is an arithmetic number, because the mean of its divisors is an integer number (77678229).
Almost surely, 2155356457 is an apocalyptic number.
It is an amenable number.
155356457 is a deficient number, since it is larger than the sum of its proper divisors (1).
155356457 is an equidigital number, since it uses as much as digits as its factorization.
155356457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 315000, while the sum is 41.
The square root of 155356457 is about 12464.2070345450. The cubic root of 155356457 is about 537.5799997745.
The spelling of 155356457 in words is "one hundred fifty-five million, three hundred fifty-six thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •