Base | Representation |
---|---|
bin | 1010011110001000000000… |
… | …1110100101011100011001 |
3 | 1111202121012022202222200222 |
4 | 2213202000032211130121 |
5 | 3002110413344112223 |
6 | 40252502241005425 |
7 | 2265522352326314 |
oct | 247420016453431 |
9 | 44677168688628 |
10 | 11512663660313 |
11 | 3739547557882 |
12 | 135b293923875 |
13 | 65684106124a |
14 | 2bb3045b197b |
15 | 14e70de530c8 |
hex | a78803a5719 |
11512663660313 has 2 divisors, whose sum is σ = 11512663660314. Its totient is φ = 11512663660312.
The previous prime is 11512663660307. The next prime is 11512663660319. The reversal of 11512663660313 is 31306636621511.
It is a balanced prime because it is at equal distance from previous prime (11512663660307) and next prime (11512663660319).
It can be written as a sum of positive squares in only one way, i.e., 10648715718169 + 863947942144 = 3263237^2 + 929488^2 .
It is a cyclic number.
It is not a de Polignac number, because 11512663660313 - 218 = 11512663398169 is a prime.
It is not a weakly prime, because it can be changed into another prime (11512663660319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5756331830156 + 5756331830157.
It is an arithmetic number, because the mean of its divisors is an integer number (5756331830157).
Almost surely, 211512663660313 is an apocalyptic number.
It is an amenable number.
11512663660313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11512663660313 is an equidigital number, since it uses as much as digits as its factorization.
11512663660313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 44.
The spelling of 11512663660313 in words is "eleven trillion, five hundred twelve billion, six hundred sixty-three million, six hundred sixty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •