Base | Representation |
---|---|
bin | 11110111011100110… |
… | …00110000001110101 |
3 | 1120212022020021201202 |
4 | 33131303012001311 |
5 | 233002122420121 |
6 | 11343445302245 |
7 | 1125341121011 |
oct | 173563060165 |
9 | 46768207652 |
10 | 16606060661 |
11 | 7051763183 |
12 | 3275404985 |
13 | 17484c45c8 |
14 | b37655541 |
15 | 672d0e40b |
hex | 3ddcc6075 |
16606060661 has 4 divisors (see below), whose sum is σ = 16613921772. Its totient is φ = 16598199552.
The previous prime is 16606060637. The next prime is 16606060693.
16606060661 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2357102500 + 14248958161 = 48550^2 + 119369^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16606060661 is a prime.
It is a super-2 number, since 2×166060606612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16606060631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3927386 + ... + 3931611.
It is an arithmetic number, because the mean of its divisors is an integer number (4153480443).
Almost surely, 216606060661 is an apocalyptic number.
It is an amenable number.
16606060661 is a deficient number, since it is larger than the sum of its proper divisors (7861111).
16606060661 is an equidigital number, since it uses as much as digits as its factorization.
16606060661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7861110.
The product of its (nonzero) digits is 46656, while the sum is 38.
The spelling of 16606060661 in words is "sixteen billion, six hundred six million, sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •