Base | Representation |
---|---|
bin | 11110110000001010… |
… | …01001101111011001 |
3 | 1120121121201120012022 |
4 | 33120011021233121 |
5 | 232303043144121 |
6 | 11330141224225 |
7 | 1123064541116 |
oct | 173005115731 |
9 | 46547646168 |
10 | 16510131161 |
11 | 70025a19a7 |
12 | 3249262075 |
13 | 17316777a4 |
14 | b28a0390d |
15 | 6696b0aab |
hex | 3d8149bd9 |
16510131161 has 2 divisors, whose sum is σ = 16510131162. Its totient is φ = 16510131160.
The previous prime is 16510131151. The next prime is 16510131181. The reversal of 16510131161 is 16113101561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13558273600 + 2951857561 = 116440^2 + 54331^2 .
It is an emirp because it is prime and its reverse (16113101561) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16510131161 - 26 = 16510131097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16510131161.
It is not a weakly prime, because it can be changed into another prime (16510131151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8255065580 + 8255065581.
It is an arithmetic number, because the mean of its divisors is an integer number (8255065581).
Almost surely, 216510131161 is an apocalyptic number.
It is an amenable number.
16510131161 is a deficient number, since it is larger than the sum of its proper divisors (1).
16510131161 is an equidigital number, since it uses as much as digits as its factorization.
16510131161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 26.
The spelling of 16510131161 in words is "sixteen billion, five hundred ten million, one hundred thirty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •