Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0011110111011010010001 |
3 | 1111010020112222111200011122 |
4 | 2210320322103313122101 |
5 | 2441122044103404243 |
6 | 40033234132452025 |
7 | 2246434161643643 |
oct | 244707223673221 |
9 | 44106488450148 |
10 | 11331102013073 |
11 | 3679547759a47 |
12 | 133006317a015 |
13 | 642697a21a9b |
14 | 2b25dd226893 |
15 | 149b345c4668 |
hex | a4e3a4f7691 |
11331102013073 has 2 divisors, whose sum is σ = 11331102013074. Its totient is φ = 11331102013072.
The previous prime is 11331102013069. The next prime is 11331102013081. The reversal of 11331102013073 is 37031020113311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10116801598864 + 1214300414209 = 3180692^2 + 1101953^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331102013073 - 22 = 11331102013069 is a prime.
It is not a weakly prime, because it can be changed into another prime (11331102013573) 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, 5665551006536 + 5665551006537.
It is an arithmetic number, because the mean of its divisors is an integer number (5665551006537).
Almost surely, 211331102013073 is an apocalyptic number.
It is an amenable number.
11331102013073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331102013073 is an equidigital number, since it uses as much as digits as its factorization.
11331102013073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
Adding to 11331102013073 its reverse (37031020113311), we get a palindrome (48362122126384).
The spelling of 11331102013073 in words is "eleven trillion, three hundred thirty-one billion, one hundred two million, thirteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •