Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …0011110100001011000001 |
3 | 1102221121011220000211211202 |
4 | 2200010221003310023001 |
5 | 2420211201112023131 |
6 | 35221213133150545 |
7 | 2213505510130256 |
oct | 240045103641301 |
9 | 42847156024752 |
10 | 11000100111041 |
11 | 3561130816908 |
12 | 1297a8732b455 |
13 | 61a3c70a6262 |
14 | 2a059c99542d |
15 | 141210381bcb |
hex | a01290f42c1 |
11000100111041 has 2 divisors, whose sum is σ = 11000100111042. Its totient is φ = 11000100111040.
The previous prime is 11000100110983. The next prime is 11000100111053. The reversal of 11000100111041 is 14011100100011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8373499690000 + 2626600421041 = 2893700^2 + 1620679^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000100111041 - 234 = 10982920241857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11000100111061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500050055520 + 5500050055521.
It is an arithmetic number, because the mean of its divisors is an integer number (5500050055521).
Almost surely, 211000100111041 is an apocalyptic number.
It is an amenable number.
11000100111041 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000100111041 is an equidigital number, since it uses as much as digits as its factorization.
11000100111041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11000100111041 its reverse (14011100100011), we get a palindrome (25011200211052).
The spelling of 11000100111041 in words is "eleven trillion, one hundred million, one hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •