Base | Representation |
---|---|
bin | 1010100110110011011000… |
… | …1101001111000101011001 |
3 | 1112021212000002211122101001 |
4 | 2221230312031033011121 |
5 | 3012031223341213321 |
6 | 40445155413225001 |
7 | 2312350633321603 |
oct | 251546615170531 |
9 | 45255002748331 |
10 | 11661745647961 |
11 | 379679a440732 |
12 | 138415b032161 |
13 | 66790c37b516 |
14 | 2c4608078173 |
15 | 153537148c91 |
hex | a9b3634f159 |
11661745647961 has 2 divisors, whose sum is σ = 11661745647962. Its totient is φ = 11661745647960.
The previous prime is 11661745647949. The next prime is 11661745647983. The reversal of 11661745647961 is 16974654716611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10624340250000 + 1037405397961 = 3259500^2 + 1018531^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11661745647961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11661745647893 and 11661745647902.
It is not a weakly prime, because it can be changed into another prime (11661745647901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5830872823980 + 5830872823981.
It is an arithmetic number, because the mean of its divisors is an integer number (5830872823981).
Almost surely, 211661745647961 is an apocalyptic number.
It is an amenable number.
11661745647961 is a deficient number, since it is larger than the sum of its proper divisors (1).
11661745647961 is an equidigital number, since it uses as much as digits as its factorization.
11661745647961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45722880, while the sum is 64.
The spelling of 11661745647961 in words is "eleven trillion, six hundred sixty-one billion, seven hundred forty-five million, six hundred forty-seven thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •