Base | Representation |
---|---|
bin | 10001111010110… |
… | …10000010011001 |
3 | 101110211210122012 |
4 | 20331122002121 |
5 | 301440041121 |
6 | 22525435305 |
7 | 3503441423 |
oct | 1075320231 |
9 | 343753565 |
10 | 150315161 |
11 | 77938007 |
12 | 4240bb35 |
13 | 251ac4a9 |
14 | 15d6b813 |
15 | d2e2c5b |
hex | 8f5a099 |
150315161 has 2 divisors, whose sum is σ = 150315162. Its totient is φ = 150315160.
The previous prime is 150315133. The next prime is 150315203. The reversal of 150315161 is 161513051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 150209536 + 105625 = 12256^2 + 325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150315161 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (150315101) 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, 75157580 + 75157581.
It is an arithmetic number, because the mean of its divisors is an integer number (75157581).
Almost surely, 2150315161 is an apocalyptic number.
It is an amenable number.
150315161 is a deficient number, since it is larger than the sum of its proper divisors (1).
150315161 is an equidigital number, since it uses as much as digits as its factorization.
150315161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 23.
The square root of 150315161 is about 12260.3083566442. The cubic root of 150315161 is about 531.7011448746.
The spelling of 150315161 in words is "one hundred fifty million, three hundred fifteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •