Base | Representation |
---|---|
bin | 1010000111111010010111… |
… | …0111010101100111001101 |
3 | 1110102010011112012101002001 |
4 | 2201332211313111213031 |
5 | 2424332334002323041 |
6 | 35401310334032301 |
7 | 2226122423330203 |
oct | 241764567254715 |
9 | 43363145171061 |
10 | 11131043011021 |
11 | 360171565971a |
12 | 12b932b948691 |
13 | 629864414c6b |
14 | 2a6a61387073 |
15 | 144825d98131 |
hex | a1fa5dd59cd |
11131043011021 has 2 divisors, whose sum is σ = 11131043011022. Its totient is φ = 11131043011020.
The previous prime is 11131043011001. The next prime is 11131043011027. The reversal of 11131043011021 is 12011034013111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10042630718121 + 1088412292900 = 3169011^2 + 1043270^2 .
It is a cyclic number.
It is not a de Polignac number, because 11131043011021 - 217 = 11131042879949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11131043011021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11131043011027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565521505510 + 5565521505511.
It is an arithmetic number, because the mean of its divisors is an integer number (5565521505511).
Almost surely, 211131043011021 is an apocalyptic number.
It is an amenable number.
11131043011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131043011021 is an equidigital number, since it uses as much as digits as its factorization.
11131043011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 11131043011021 its reverse (12011034013111), we get a palindrome (23142077024132).
The spelling of 11131043011021 in words is "eleven trillion, one hundred thirty-one billion, forty-three million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •