Base | Representation |
---|---|
bin | 1010010011100011101011… |
… | …1110010010010100000101 |
3 | 1111010020120202102122021112 |
4 | 2210320322332102110011 |
5 | 2441122104430231232 |
6 | 40033235211054405 |
7 | 2246434355320325 |
oct | 244707276222405 |
9 | 44106522378245 |
10 | 11331113133317 |
11 | 3679552a6482a |
12 | 1330066a41405 |
13 | 64269a116503 |
14 | 2b26008bd285 |
15 | 149b3556e4b2 |
hex | a4e3af92505 |
11331113133317 has 2 divisors, whose sum is σ = 11331113133318. Its totient is φ = 11331113133316.
The previous prime is 11331113133163. The next prime is 11331113133323. The reversal of 11331113133317 is 71333131113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10941236524516 + 389876608801 = 3307754^2 + 624401^2 .
It is an emirp because it is prime and its reverse (71333131113311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11331113133317 - 210 = 11331113132293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331113193317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665556566658 + 5665556566659.
It is an arithmetic number, because the mean of its divisors is an integer number (5665556566659).
Almost surely, 211331113133317 is an apocalyptic number.
It is an amenable number.
11331113133317 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331113133317 is an equidigital number, since it uses as much as digits as its factorization.
11331113133317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5103, while the sum is 32.
Adding to 11331113133317 its reverse (71333131113311), we get a palindrome (82664244246628).
The spelling of 11331113133317 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirteen million, one hundred thirty-three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •