Base | Representation |
---|---|
bin | 1111000110101000001110… |
… | …0011001101001001111011 |
3 | 2011210120102001202100120120 |
4 | 3301222003203031021323 |
5 | 4134040203424014210 |
6 | 55152535524424323 |
7 | 3332532543105453 |
oct | 361520343151173 |
9 | 64716361670516 |
10 | 16606550610555 |
11 | 53228869846a4 |
12 | 1a425642480a3 |
13 | 935cb6306929 |
14 | 415a9317cd63 |
15 | 1dbe93d95270 |
hex | f1a838cd27b |
16606550610555 has 16 divisors (see below), whose sum is σ = 26661165219360. Its totient is φ = 8826598911488.
The previous prime is 16606550610553. The next prime is 16606550610563. The reversal of 16606550610555 is 55501605560661.
It is a cyclic number.
It is not a de Polignac number, because 16606550610555 - 21 = 16606550610553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16606550610498 and 16606550610507.
It is not an unprimeable number, because it can be changed into a prime (16606550610553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1889250510 + ... + 1889259299.
It is an arithmetic number, because the mean of its divisors is an integer number (1666322826210).
Almost surely, 216606550610555 is an apocalyptic number.
16606550610555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
16606550610555 is a deficient number, since it is larger than the sum of its proper divisors (10054614608805).
16606550610555 is a wasteful number, since it uses less digits than its factorization.
16606550610555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3778510110.
The product of its (nonzero) digits is 4050000, while the sum is 51.
The spelling of 16606550610555 in words is "sixteen trillion, six hundred six billion, five hundred fifty million, six hundred ten thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •