Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0001001001110101111101 |
3 | 1111010020112221011112221211 |
4 | 2210320322101021311331 |
5 | 2441122043413132031 |
6 | 40033234105324421 |
7 | 2246434152623155 |
oct | 244707221116575 |
9 | 44106487145854 |
10 | 11331101302141 |
11 | 36795473138a5 |
12 | 1330062a96711 |
13 | 64269783330a |
14 | 2b25dd0bd765 |
15 | 149b344d3bb1 |
hex | a4e3a449d7d |
11331101302141 has 2 divisors, whose sum is σ = 11331101302142. Its totient is φ = 11331101302140.
The previous prime is 11331101302099. The next prime is 11331101302201. The reversal of 11331101302141 is 14120310113311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10289178905625 + 1041922396516 = 3207675^2 + 1020746^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331101302141 - 211 = 11331101300093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331111302141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665550651070 + 5665550651071.
It is an arithmetic number, because the mean of its divisors is an integer number (5665550651071).
Almost surely, 211331101302141 is an apocalyptic number.
It is an amenable number.
11331101302141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331101302141 is an equidigital number, since it uses as much as digits as its factorization.
11331101302141 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 11331101302141 its reverse (14120310113311), we get a palindrome (25451411415452).
The spelling of 11331101302141 in words is "eleven trillion, three hundred thirty-one billion, one hundred one million, three hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •