Base | Representation |
---|---|
bin | 1010101000011011011000… |
… | …1011101111100011100001 |
3 | 1112101112001200101220110012 |
4 | 2222012312023233203201 |
5 | 3013010412102402342 |
6 | 40510053513214305 |
7 | 2314356510114416 |
oct | 252066613574341 |
9 | 45345050356405 |
10 | 11689662544097 |
11 | 37a7615836a1a |
12 | 1389650401395 |
13 | 66a43acc0185 |
14 | 2c5ad599410d |
15 | 15411ce46b82 |
hex | aa1b62ef8e1 |
11689662544097 has 2 divisors, whose sum is σ = 11689662544098. Its totient is φ = 11689662544096.
The previous prime is 11689662544073. The next prime is 11689662544099. The reversal of 11689662544097 is 79044526698611.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7624313798656 + 4065348745441 = 2761216^2 + 2016271^2 .
It is a cyclic number.
It is not a de Polignac number, because 11689662544097 - 210 = 11689662543073 is a prime.
Together with 11689662544099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11689662544099) 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, 5844831272048 + 5844831272049.
It is an arithmetic number, because the mean of its divisors is an integer number (5844831272049).
Almost surely, 211689662544097 is an apocalyptic number.
It is an amenable number.
11689662544097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11689662544097 is an equidigital number, since it uses as much as digits as its factorization.
11689662544097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 156764160, while the sum is 68.
The spelling of 11689662544097 in words is "eleven trillion, six hundred eighty-nine billion, six hundred sixty-two million, five hundred forty-four thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •