Base | Representation |
---|---|
bin | 100010110000111… |
… | …1110110101001101 |
3 | 10000022001011120112 |
4 | 1011201332311031 |
5 | 4342113123023 |
6 | 311430525405 |
7 | 40623251426 |
oct | 10541766515 |
9 | 3008034515 |
10 | 1166536013 |
11 | 54952a855 |
12 | 286806865 |
13 | 1578a88c6 |
14 | b0cdc64d |
15 | 6c62a478 |
hex | 4587ed4d |
1166536013 has 2 divisors, whose sum is σ = 1166536014. Its totient is φ = 1166536012.
The previous prime is 1166535943. The next prime is 1166536051. The reversal of 1166536013 is 3106356611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 962674729 + 203861284 = 31027^2 + 14278^2 .
It is an emirp because it is prime and its reverse (3106356611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1166536013 - 210 = 1166534989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1166532013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 583268006 + 583268007.
It is an arithmetic number, because the mean of its divisors is an integer number (583268007).
Almost surely, 21166536013 is an apocalyptic number.
It is an amenable number.
1166536013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1166536013 is an equidigital number, since it uses as much as digits as its factorization.
1166536013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 1166536013 is about 34154.5899258065. The cubic root of 1166536013 is about 1052.6873002594.
The spelling of 1166536013 in words is "one billion, one hundred sixty-six million, five hundred thirty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •