Base | Representation |
---|---|
bin | 1100010011100011… |
… | …01111110110110001 |
3 | 122001102021022101021 |
4 | 12021301233312301 |
5 | 102012230040321 |
6 | 3011315535441 |
7 | 322500132634 |
oct | 61161576661 |
9 | 18042238337 |
10 | 6606486961 |
11 | 289020a488 |
12 | 13445ba581 |
13 | 8139261a9 |
14 | 4695a3c1b |
15 | 289ed7941 |
hex | 189c6fdb1 |
6606486961 has 16 divisors (see below), whose sum is σ = 6790349440. Its totient is φ = 6425464320.
The previous prime is 6606486923. The next prime is 6606487039. The reversal of 6606486961 is 1696846066.
6606486961 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 6606486961 - 27 = 6606486833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6606486899 and 6606486908.
It is not an unprimeable number, because it can be changed into a prime (6606486361) 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 15 ways as a sum of consecutive naturals, for example, 3515020 + ... + 3516898.
It is an arithmetic number, because the mean of its divisors is an integer number (424396840).
Almost surely, 26606486961 is an apocalyptic number.
It is an amenable number.
6606486961 is a deficient number, since it is larger than the sum of its proper divisors (183862479).
6606486961 is a wasteful number, since it uses less digits than its factorization.
6606486961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2584.
The product of its (nonzero) digits is 2239488, while the sum is 52.
The square root of 6606486961 is about 81280.2987260751. The cubic root of 6606486961 is about 1876.3918043977.
The spelling of 6606486961 in words is "six billion, six hundred six million, four hundred eighty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •