Base | Representation |
---|---|
bin | 1010100111000011110110… |
… | …1101110101011101111101 |
3 | 1112022021102012122100122121 |
4 | 2221300331231311131331 |
5 | 3012114302122222342 |
6 | 40451210221442541 |
7 | 2312565324650344 |
oct | 251607555653575 |
9 | 45267365570577 |
10 | 11666166601597 |
11 | 3798658a01622 |
12 | 1384b93710451 |
13 | 668165269a11 |
14 | 2c4907288b5b |
15 | 1536e5321067 |
hex | a9c3db7577d |
11666166601597 has 2 divisors, whose sum is σ = 11666166601598. Its totient is φ = 11666166601596.
The previous prime is 11666166601561. The next prime is 11666166601643. The reversal of 11666166601597 is 79510666166611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6007886307801 + 5658280293796 = 2451099^2 + 2378714^2 .
It is an emirp because it is prime and its reverse (79510666166611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11666166601597 - 27 = 11666166601469 is a prime.
It is a super-2 number, since 2×116661666015972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11666166607597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5833083300798 + 5833083300799.
It is an arithmetic number, because the mean of its divisors is an integer number (5833083300799).
Almost surely, 211666166601597 is an apocalyptic number.
It is an amenable number.
11666166601597 is a deficient number, since it is larger than the sum of its proper divisors (1).
11666166601597 is an equidigital number, since it uses as much as digits as its factorization.
11666166601597 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14696640, while the sum is 61.
The spelling of 11666166601597 in words is "eleven trillion, six hundred sixty-six billion, one hundred sixty-six million, six hundred one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •