Base | Representation |
---|---|
bin | 11110001001111110… |
… | …01000101000100101 |
3 | 1112210021221101011012 |
4 | 33010333020220211 |
5 | 231124041133121 |
6 | 11234255152005 |
7 | 1112124626126 |
oct | 170477105045 |
9 | 45707841135 |
10 | 16189786661 |
11 | 6958792384 |
12 | 3179b15605 |
13 | 16b01a5829 |
14 | ad825604d |
15 | 64b4d3c5b |
hex | 3c4fc8a25 |
16189786661 has 2 divisors, whose sum is σ = 16189786662. Its totient is φ = 16189786660.
The previous prime is 16189786651. The next prime is 16189786771. The reversal of 16189786661 is 16668798161.
16189786661 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., 12292156900 + 3897629761 = 110870^2 + 62431^2 .
It is a cyclic number.
It is not a de Polignac number, because 16189786661 - 26 = 16189786597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16189786661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16189786621) 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, 8094893330 + 8094893331.
It is an arithmetic number, because the mean of its divisors is an integer number (8094893331).
Almost surely, 216189786661 is an apocalyptic number.
It is an amenable number.
16189786661 is a deficient number, since it is larger than the sum of its proper divisors (1).
16189786661 is an equidigital number, since it uses as much as digits as its factorization.
16189786661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5225472, while the sum is 59.
The spelling of 16189786661 in words is "sixteen billion, one hundred eighty-nine million, seven hundred eighty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •