Base | Representation |
---|---|
bin | 11111000010000110… |
… | …00000000001001111 |
3 | 1121000002210020111211 |
4 | 33201003000001033 |
5 | 233110100440444 |
6 | 11353113355251 |
7 | 1126602304024 |
oct | 174103000117 |
9 | 47002706454 |
10 | 16660561999 |
11 | 707a4a8904 |
12 | 328b708b27 |
13 | 1756897813 |
14 | b409a154b |
15 | 6779c7c34 |
hex | 3e10c004f |
16660561999 has 2 divisors, whose sum is σ = 16660562000. Its totient is φ = 16660561998.
The previous prime is 16660561961. The next prime is 16660562027. The reversal of 16660561999 is 99916506661.
It is a strong prime.
It is an emirp because it is prime and its reverse (99916506661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16660561999 - 29 = 16660561487 is a prime.
It is a super-2 number, since 2×166605619992 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16660561949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8330280999 + 8330281000.
It is an arithmetic number, because the mean of its divisors is an integer number (8330281000).
Almost surely, 216660561999 is an apocalyptic number.
16660561999 is a deficient number, since it is larger than the sum of its proper divisors (1).
16660561999 is an equidigital number, since it uses as much as digits as its factorization.
16660561999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4723920, while the sum is 58.
The spelling of 16660561999 in words is "sixteen billion, six hundred sixty million, five hundred sixty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •