Base | Representation |
---|---|
bin | 1010011001111110001111… |
… | …0100011110100011111101 |
3 | 1111111210001021021022021012 |
4 | 2212133203310132203331 |
5 | 2444423310421001244 |
6 | 40200023032445005 |
7 | 2260415402115464 |
oct | 246374364364375 |
9 | 44453037238235 |
10 | 11441320093949 |
11 | 3711266a11489 |
12 | 13494a2b49765 |
13 | 64cbb1466a15 |
14 | 2b7a973779db |
15 | 14c9358e889e |
hex | a67e3d1e8fd |
11441320093949 has 2 divisors, whose sum is σ = 11441320093950. Its totient is φ = 11441320093948.
The previous prime is 11441320093943. The next prime is 11441320093979. The reversal of 11441320093949 is 94939002314411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9156415765849 + 2284904328100 = 3025957^2 + 1511590^2 .
It is an emirp because it is prime and its reverse (94939002314411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11441320093949 - 240 = 10341808466173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11441320093897 and 11441320093906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11441320093943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5720660046974 + 5720660046975.
It is an arithmetic number, because the mean of its divisors is an integer number (5720660046975).
Almost surely, 211441320093949 is an apocalyptic number.
It is an amenable number.
11441320093949 is a deficient number, since it is larger than the sum of its proper divisors (1).
11441320093949 is an equidigital number, since it uses as much as digits as its factorization.
11441320093949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 839808, while the sum is 50.
The spelling of 11441320093949 in words is "eleven trillion, four hundred forty-one billion, three hundred twenty million, ninety-three thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •