Base | Representation |
---|---|
bin | 1010100010010000100000… |
… | …0110011110110100100101 |
3 | 1112000101110101000121210111 |
4 | 2220210020012132310211 |
5 | 3004241320123323044 |
6 | 40345243341053021 |
7 | 2303614650326341 |
oct | 250441006366445 |
9 | 45011411017714 |
10 | 11583662714149 |
11 | 3766670686879 |
12 | 1370ba9257171 |
13 | 6604474741c6 |
14 | 2c091bb6a621 |
15 | 1514b7109b34 |
hex | a890819ed25 |
11583662714149 has 2 divisors, whose sum is σ = 11583662714150. Its totient is φ = 11583662714148.
The previous prime is 11583662714093. The next prime is 11583662714159. The reversal of 11583662714149 is 94141726638511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9269254257025 + 2314408457124 = 3044545^2 + 1521318^2 .
It is an emirp because it is prime and its reverse (94141726638511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11583662714149 - 27 = 11583662714021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11583662714093 and 11583662714102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11583662714159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5791831357074 + 5791831357075.
It is an arithmetic number, because the mean of its divisors is an integer number (5791831357075).
Almost surely, 211583662714149 is an apocalyptic number.
It is an amenable number.
11583662714149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11583662714149 is an equidigital number, since it uses as much as digits as its factorization.
11583662714149 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8709120, while the sum is 58.
The spelling of 11583662714149 in words is "eleven trillion, five hundred eighty-three billion, six hundred sixty-two million, seven hundred fourteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •