Base | Representation |
---|---|
bin | 11110101111011000… |
… | …00100110000001011 |
3 | 1120121011100120022201 |
4 | 33113230010300023 |
5 | 232244402312011 |
6 | 11325344301031 |
7 | 1122654630625 |
oct | 172754046013 |
9 | 46534316281 |
10 | 16503557131 |
11 | 6aa9911816 |
12 | 3247011777 |
13 | 17301b5429 |
14 | b27bb1c15 |
15 | 668d12cc1 |
hex | 3d7b04c0b |
16503557131 has 2 divisors, whose sum is σ = 16503557132. Its totient is φ = 16503557130.
The previous prime is 16503557117. The next prime is 16503557159. The reversal of 16503557131 is 13175530561.
16503557131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 16503557131 - 25 = 16503557099 is a prime.
It is a super-2 number, since 2×165035571312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16503557531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8251778565 + 8251778566.
It is an arithmetic number, because the mean of its divisors is an integer number (8251778566).
Almost surely, 216503557131 is an apocalyptic number.
16503557131 is a deficient number, since it is larger than the sum of its proper divisors (1).
16503557131 is an equidigital number, since it uses as much as digits as its factorization.
16503557131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47250, while the sum is 37.
The spelling of 16503557131 in words is "sixteen billion, five hundred three million, five hundred fifty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •