Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0001001100010011011101 |
3 | 1111010020112221012001210011 |
4 | 2210320322101030103131 |
5 | 2441122043413442341 |
6 | 40033234105443221 |
7 | 2246434152664435 |
oct | 244707221142335 |
9 | 44106487161704 |
10 | 11331101312221 |
11 | 3679547320429 |
12 | 1330062aa0511 |
13 | 642697837a92 |
14 | 2b25dd0c32c5 |
15 | 149b344d6b81 |
hex | a4e3a44c4dd |
11331101312221 has 2 divisors, whose sum is σ = 11331101312222. Its totient is φ = 11331101312220.
The previous prime is 11331101312171. The next prime is 11331101312327. The reversal of 11331101312221 is 12221310113311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10276762536121 + 1054338776100 = 3205739^2 + 1026810^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11331101312221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331101312192 and 11331101312201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331101312621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665550656110 + 5665550656111.
It is an arithmetic number, because the mean of its divisors is an integer number (5665550656111).
Almost surely, 211331101312221 is an apocalyptic number.
It is an amenable number.
11331101312221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331101312221 is an equidigital number, since it uses as much as digits as its factorization.
11331101312221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11331101312221 its reverse (12221310113311), we get a palindrome (23552411425532).
The spelling of 11331101312221 in words is "eleven trillion, three hundred thirty-one billion, one hundred one million, three hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •