Base | Representation |
---|---|
bin | 1010010011100011101011… |
… | …0011111001101100100001 |
3 | 1111010020120120022100000111 |
4 | 2210320322303321230201 |
5 | 2441122103231123131 |
6 | 40033235032451321 |
7 | 2246434323221551 |
oct | 244707263715441 |
9 | 44106516270014 |
10 | 11331110411041 |
11 | 3679551475513 |
12 | 1330065b49b41 |
13 | 6426996a23b5 |
14 | 2b26003b1161 |
15 | 149b351d2ab1 |
hex | a4e3acf9b21 |
11331110411041 has 2 divisors, whose sum is σ = 11331110411042. Its totient is φ = 11331110411040.
The previous prime is 11331110410979. The next prime is 11331110411053. The reversal of 11331110411041 is 14011401113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10108584360000 + 1222526051041 = 3179400^2 + 1105679^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331110411041 - 213 = 11331110402849 is a prime.
It is not a weakly prime, because it can be changed into another prime (11331110411141) 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, 5665555205520 + 5665555205521.
It is an arithmetic number, because the mean of its divisors is an integer number (5665555205521).
Almost surely, 211331110411041 is an apocalyptic number.
It is an amenable number.
11331110411041 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331110411041 is an equidigital number, since it uses as much as digits as its factorization.
11331110411041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 11331110411041 its reverse (14011401113311), we get a palindrome (25342511524352).
The spelling of 11331110411041 in words is "eleven trillion, three hundred thirty-one billion, one hundred ten million, four hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •