Base | Representation |
---|---|
bin | 10001010011011… |
… | …10010001011001 |
3 | 101010010122110002 |
4 | 20221232101121 |
5 | 244124431121 |
6 | 22223102345 |
7 | 3411540614 |
oct | 1051562131 |
9 | 333118402 |
10 | 145155161 |
11 | 74a33248 |
12 | 407419b5 |
13 | 240c3938 |
14 | 153c717b |
15 | cb23e0b |
hex | 8a6e459 |
145155161 has 2 divisors, whose sum is σ = 145155162. Its totient is φ = 145155160.
The previous prime is 145155151. The next prime is 145155187. The reversal of 145155161 is 161551541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132595225 + 12559936 = 11515^2 + 3544^2 .
It is an emirp because it is prime and its reverse (161551541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145155161 - 210 = 145154137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (145155151) 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, 72577580 + 72577581.
It is an arithmetic number, because the mean of its divisors is an integer number (72577581).
Almost surely, 2145155161 is an apocalyptic number.
It is an amenable number.
145155161 is a deficient number, since it is larger than the sum of its proper divisors (1).
145155161 is an equidigital number, since it uses as much as digits as its factorization.
145155161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3000, while the sum is 29.
The square root of 145155161 is about 12048.0355660166. The cubic root of 145155161 is about 525.5461117004.
The spelling of 145155161 in words is "one hundred forty-five million, one hundred fifty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.582 sec. • engine limits •