Base | Representation |
---|---|
bin | 1010100110110000110110… |
… | …1110101101010011010111 |
3 | 1112021210020210000020012022 |
4 | 2221230031232231103113 |
5 | 3012023331014303011 |
6 | 40445004154043355 |
7 | 2312325046202522 |
oct | 251541556552327 |
9 | 45253223006168 |
10 | 11661066556631 |
11 | 3796481082328 |
12 | 1383bab71955b |
13 | 66783178002b |
14 | 2c4581bc3bb9 |
15 | 1534e77068db |
hex | a9b0dbad4d7 |
11661066556631 has 2 divisors, whose sum is σ = 11661066556632. Its totient is φ = 11661066556630.
The previous prime is 11661066556609. The next prime is 11661066556637. The reversal of 11661066556631 is 13665566016611.
It is a strong prime.
It is an emirp because it is prime and its reverse (13665566016611) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11661066556631 is a prime.
It is a super-2 number, since 2×116610665566312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11661066556637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5830533278315 + 5830533278316.
It is an arithmetic number, because the mean of its divisors is an integer number (5830533278316).
Almost surely, 211661066556631 is an apocalyptic number.
11661066556631 is a deficient number, since it is larger than the sum of its proper divisors (1).
11661066556631 is an equidigital number, since it uses as much as digits as its factorization.
11661066556631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 53.
The spelling of 11661066556631 in words is "eleven trillion, six hundred sixty-one billion, sixty-six million, five hundred fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •