Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011100110010110011001 |
3 | 1111010020122000121202211122 |
4 | 2210320330003212112121 |
5 | 2441122124103201241 |
6 | 40033241100335025 |
7 | 2246434665625154 |
oct | 244707403462631 |
9 | 44106560552748 |
10 | 11331131303321 |
11 | 3679562245165 |
12 | 1330070b44475 |
13 | 6426a0b089ab |
14 | 2b260308cc9b |
15 | 149b36e5d04b |
hex | a4e3c0e6599 |
11331131303321 has 2 divisors, whose sum is σ = 11331131303322. Its totient is φ = 11331131303320.
The previous prime is 11331131303209. The next prime is 11331131303341. The reversal of 11331131303321 is 12330313113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7072009455625 + 4259121847696 = 2659325^2 + 2063764^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11331131303321 is a prime.
It is a super-2 number, since 2×113311313033212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11331131303341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665565651660 + 5665565651661.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565651661).
Almost surely, 211331131303321 is an apocalyptic number.
It is an amenable number.
11331131303321 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131303321 is an equidigital number, since it uses as much as digits as its factorization.
11331131303321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 11331131303321 its reverse (12330313113311), we get a palindrome (23661444416632).
The spelling of 11331131303321 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •