Base | Representation |
---|---|
bin | 10010000000000… |
… | …10011111101001 |
3 | 101112010212010202 |
4 | 21000002133221 |
5 | 302124131121 |
6 | 22552321545 |
7 | 3512344166 |
oct | 1100023751 |
9 | 345125122 |
10 | 151005161 |
11 | 7826945a |
12 | 426a32b5 |
13 | 25391588 |
14 | 160ab06d |
15 | d3cc40b |
hex | 90027e9 |
151005161 has 2 divisors, whose sum is σ = 151005162. Its totient is φ = 151005160.
The previous prime is 151005133. The next prime is 151005187. The reversal of 151005161 is 161500151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130393561 + 20611600 = 11419^2 + 4540^2 .
It is an emirp because it is prime and its reverse (161500151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151005161 - 214 = 150988777 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (151005191) 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, 75502580 + 75502581.
It is an arithmetic number, because the mean of its divisors is an integer number (75502581).
Almost surely, 2151005161 is an apocalyptic number.
It is an amenable number.
151005161 is a deficient number, since it is larger than the sum of its proper divisors (1).
151005161 is an equidigital number, since it uses as much as digits as its factorization.
151005161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 20.
The square root of 151005161 is about 12288.4157237620. The cubic root of 151005161 is about 532.5134689151.
The spelling of 151005161 in words is "one hundred fifty-one million, five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •