Base | Representation |
---|---|
bin | 111011111111100… |
… | …000101011010101 |
3 | 2121010220201211102 |
4 | 323333200223111 |
5 | 4030131122121 |
6 | 243512515445 |
7 | 33641101631 |
oct | 7377405325 |
9 | 2533821742 |
10 | 1006504661 |
11 | 477166938 |
12 | 2410abb85 |
13 | 1306a6ab6 |
14 | 97961dc1 |
15 | 5d56890b |
hex | 3bfe0ad5 |
1006504661 has 2 divisors, whose sum is σ = 1006504662. Its totient is φ = 1006504660.
The previous prime is 1006504589. The next prime is 1006504663. The reversal of 1006504661 is 1664056001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 746327761 + 260176900 = 27319^2 + 16130^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1006504661 is a prime.
It is a super-2 number, since 2×10065046612 = 2026103265229449842, which contains 22 as substring.
Together with 1006504663, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1006504663) 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 as a sum of consecutive naturals, namely, 503252330 + 503252331.
It is an arithmetic number, because the mean of its divisors is an integer number (503252331).
Almost surely, 21006504661 is an apocalyptic number.
It is an amenable number.
1006504661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1006504661 is an equidigital number, since it uses as much as digits as its factorization.
1006504661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 1006504661 is about 31725.4576168729. The cubic root of 1006504661 is about 1002.1635360693.
The spelling of 1006504661 in words is "one billion, six million, five hundred four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •