Base | Representation |
---|---|
bin | 1010010011100011101101… |
… | …1101001011110100011101 |
3 | 1111010020121022200011012111 |
4 | 2210320323131023310131 |
5 | 2441122114013430211 |
6 | 40033240100434021 |
7 | 2246434514214151 |
oct | 244707335136435 |
9 | 44106538604174 |
10 | 11331121233181 |
11 | 3679557597332 |
12 | 13300696a8911 |
13 | 64269b9c1229 |
14 | 2b26019cb061 |
15 | 149b3611e421 |
hex | a4e3b74bd1d |
11331121233181 has 2 divisors, whose sum is σ = 11331121233182. Its totient is φ = 11331121233180.
The previous prime is 11331121233161. The next prime is 11331121233253. The reversal of 11331121233181 is 18133212113311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11330999484025 + 121749156 = 3366155^2 + 11034^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331121233181 - 213 = 11331121224989 is a prime.
It is a super-2 number, since 2×113311212331812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331121233101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665560616590 + 5665560616591.
It is an arithmetic number, because the mean of its divisors is an integer number (5665560616591).
Almost surely, 211331121233181 is an apocalyptic number.
It is an amenable number.
11331121233181 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331121233181 is an equidigital number, since it uses as much as digits as its factorization.
11331121233181 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 31.
Adding to 11331121233181 its reverse (18133212113311), we get a palindrome (29464333346492).
The spelling of 11331121233181 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-one million, two hundred thirty-three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •