Base | Representation |
---|---|
bin | 1010010011100100011101… |
… | …0100101001100000011001 |
3 | 1111010021010012021220211011 |
4 | 2210321013110221200121 |
5 | 2441123021000301243 |
6 | 40033311531533521 |
7 | 2246442452355223 |
oct | 244710724514031 |
9 | 44107105256734 |
10 | 11331320322073 |
11 | 3679649a07804 |
12 | 13301042ba2a1 |
13 | 6427010198cb |
14 | 2b2620213413 |
15 | 149b4884889d |
hex | a4e47529819 |
11331320322073 has 2 divisors, whose sum is σ = 11331320322074. Its totient is φ = 11331320322072.
The previous prime is 11331320322019. The next prime is 11331320322169. The reversal of 11331320322073 is 37022302313311.
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., 9934933792729 + 1396386529344 = 3151973^2 + 1181688^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331320322073 - 233 = 11322730387481 is a prime.
It is not a weakly prime, because it can be changed into another prime (11331320322013) 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, 5665660161036 + 5665660161037.
It is an arithmetic number, because the mean of its divisors is an integer number (5665660161037).
Almost surely, 211331320322073 is an apocalyptic number.
It is an amenable number.
11331320322073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331320322073 is an equidigital number, since it uses as much as digits as its factorization.
11331320322073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 31.
Adding to 11331320322073 its reverse (37022302313311), we get a palindrome (48353622635384).
The spelling of 11331320322073 in words is "eleven trillion, three hundred thirty-one billion, three hundred twenty million, three hundred twenty-two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •