Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …0111100101111000110111 |
3 | 1102221121011221220010222000 |
4 | 2200010221013211320313 |
5 | 2420211201340213421 |
6 | 35221213210310343 |
7 | 2213505521422623 |
oct | 240045107457067 |
9 | 42847157803860 |
10 | 11000101101111 |
11 | 3561131332751 |
12 | 1297a877283b3 |
13 | 61a3c7361ab5 |
14 | 2a059cb72183 |
15 | 1412104ca226 |
hex | a01291e5e37 |
11000101101111 has 16 divisors (see below), whose sum is σ = 16675433195520. Its totient is φ = 7162856530200.
The previous prime is 11000101101097. The next prime is 11000101101137. The reversal of 11000101101111 is 11110110100011.
It is not a de Polignac number, because 11000101101111 - 26 = 11000101101047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11000101101093 and 11000101101102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000101103111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4737337815 + ... + 4737340136.
It is an arithmetic number, because the mean of its divisors is an integer number (1042214574720).
Almost surely, 211000101101111 is an apocalyptic number.
11000101101111 is a deficient number, since it is larger than the sum of its proper divisors (5675332094409).
11000101101111 is an equidigital number, since it uses as much as digits as its factorization.
11000101101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9474678003 (or 9474677997 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11000101101111 its reverse (11110110100011), we get a palindrome (22110211201122).
The spelling of 11000101101111 in words is "eleven trillion, one hundred one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •