Base | Representation |
---|---|
bin | 1100010100001000… |
… | …01100100001010001 |
3 | 122001202101000010101 |
4 | 12022010030201101 |
5 | 102014444313321 |
6 | 3012011332401 |
7 | 322556214025 |
oct | 61204144121 |
9 | 18052330111 |
10 | 6611322961 |
11 | 2892a12881 |
12 | 1346151101 |
13 | 81492a429 |
14 | 46a0a2385 |
15 | 28a640791 |
hex | 18a10c851 |
6611322961 has 2 divisors, whose sum is σ = 6611322962. Its totient is φ = 6611322960.
The previous prime is 6611322959. The next prime is 6611322989. The reversal of 6611322961 is 1692231166.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6013227025 + 598095936 = 77545^2 + 24456^2 .
It is a cyclic number.
It is not a de Polignac number, because 6611322961 - 21 = 6611322959 is a prime.
Together with 6611322959, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 6611322961.
It is not a weakly prime, because it can be changed into another prime (6611322941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3305661480 + 3305661481.
It is an arithmetic number, because the mean of its divisors is an integer number (3305661481).
Almost surely, 26611322961 is an apocalyptic number.
It is an amenable number.
6611322961 is a deficient number, since it is larger than the sum of its proper divisors (1).
6611322961 is an equidigital number, since it uses as much as digits as its factorization.
6611322961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23328, while the sum is 37.
The square root of 6611322961 is about 81310.0421903715. The cubic root of 6611322961 is about 1876.8495372081.
The spelling of 6611322961 in words is "six billion, six hundred eleven million, three hundred twenty-two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •