Base | Representation |
---|---|
bin | 10000011101010101100… |
… | …001101101111010110001 |
3 | 11000010100010022002022222 |
4 | 100131111201231322301 |
5 | 122012302343113131 |
6 | 2223325053210425 |
7 | 144466341302636 |
oct | 20352541557261 |
9 | 4003303262288 |
10 | 1131011301041 |
11 | 3a6728437506 |
12 | 163245490a15 |
13 | 8286683634b |
14 | 3ca53d6218d |
15 | 1e64828e87b |
hex | 1075586deb1 |
1131011301041 has 2 divisors, whose sum is σ = 1131011301042. Its totient is φ = 1131011301040.
The previous prime is 1131011300983. The next prime is 1131011301073. The reversal of 1131011301041 is 1401031101311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 838469862400 + 292541438641 = 915680^2 + 540871^2 .
It is an emirp because it is prime and its reverse (1401031101311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1131011301041 - 26 = 1131011300977 is a prime.
It is not a weakly prime, because it can be changed into another prime (1131011301241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565505650520 + 565505650521.
It is an arithmetic number, because the mean of its divisors is an integer number (565505650521).
Almost surely, 21131011301041 is an apocalyptic number.
It is an amenable number.
1131011301041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131011301041 is an equidigital number, since it uses as much as digits as its factorization.
1131011301041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1131011301041 its reverse (1401031101311), we get a palindrome (2532042402352).
The spelling of 1131011301041 in words is "one trillion, one hundred thirty-one billion, eleven million, three hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •