Base | Representation |
---|---|
bin | 11111001010100000… |
… | …10101011000110101 |
3 | 1121012000122022100111 |
4 | 33211100111120311 |
5 | 233231134310021 |
6 | 11404114543021 |
7 | 1131420365245 |
oct | 174520253065 |
9 | 47160568314 |
10 | 16731166261 |
11 | 7106341937 |
12 | 32ab297a71 |
13 | 17683b83a4 |
14 | b4a0ddb25 |
15 | 67dcc28e1 |
hex | 3e5415635 |
16731166261 has 2 divisors, whose sum is σ = 16731166262. Its totient is φ = 16731166260.
The previous prime is 16731166247. The next prime is 16731166339. The reversal of 16731166261 is 16266113761.
16731166261 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 can be written as a sum of positive squares in only one way, i.e., 16545934161 + 185232100 = 128631^2 + 13610^2 .
It is an emirp because it is prime and its reverse (16266113761) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16731166261 - 25 = 16731166229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16731166201) 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, 8365583130 + 8365583131.
It is an arithmetic number, because the mean of its divisors is an integer number (8365583131).
Almost surely, 216731166261 is an apocalyptic number.
It is an amenable number.
16731166261 is a deficient number, since it is larger than the sum of its proper divisors (1).
16731166261 is an equidigital number, since it uses as much as digits as its factorization.
16731166261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54432, while the sum is 40.
The spelling of 16731166261 in words is "sixteen billion, seven hundred thirty-one million, one hundred sixty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •