Base | Representation |
---|---|
bin | 10010100000101… |
… | …00111100110101 |
3 | 101211011210100012 |
4 | 21100110330311 |
5 | 304222300221 |
6 | 23224030005 |
7 | 3563546654 |
oct | 1120247465 |
9 | 354153305 |
10 | 155275061 |
11 | 7a7154a7 |
12 | 44002305 |
13 | 26227c46 |
14 | 1689d19b |
15 | d97265b |
hex | 9414f35 |
155275061 has 2 divisors, whose sum is σ = 155275062. Its totient is φ = 155275060.
The previous prime is 155275033. The next prime is 155275069. The reversal of 155275061 is 160572551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150822961 + 4452100 = 12281^2 + 2110^2 .
It is an emirp because it is prime and its reverse (160572551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 155275061 - 26 = 155274997 is a prime.
It is a super-2 number, since 2×1552750612 = 48220689137107442, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155275069) 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, 77637530 + 77637531.
It is an arithmetic number, because the mean of its divisors is an integer number (77637531).
Almost surely, 2155275061 is an apocalyptic number.
It is an amenable number.
155275061 is a deficient number, since it is larger than the sum of its proper divisors (1).
155275061 is an equidigital number, since it uses as much as digits as its factorization.
155275061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10500, while the sum is 32.
The square root of 155275061 is about 12460.9414170840. The cubic root of 155275061 is about 537.4860985047.
The spelling of 155275061 in words is "one hundred fifty-five million, two hundred seventy-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •