Base | Representation |
---|---|
bin | 1010000000010010100110… |
… | …1001111010111000111011 |
3 | 1102221121012120211100011012 |
4 | 2200010221221322320323 |
5 | 2420211211141200102 |
6 | 35221214131224135 |
7 | 2213505661052546 |
oct | 240045151727073 |
9 | 42847176740135 |
10 | 11000110100027 |
11 | 3561136419774 |
12 | 1297a8a74804b |
13 | 61a3c9192ab9 |
14 | 2a05a003585d |
15 | 1412111a6752 |
hex | a0129a7ae3b |
11000110100027 has 2 divisors, whose sum is σ = 11000110100028. Its totient is φ = 11000110100026.
The previous prime is 11000110099919. The next prime is 11000110100041. The reversal of 11000110100027 is 72000101100011.
It is an a-pointer prime, because the next prime (11000110100041) can be obtained adding 11000110100027 to its sum of digits (14).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11000110100027 - 234 = 10982930230843 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000110099984 and 11000110100020.
It is not a weakly prime, because it can be changed into another prime (11000110100927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500055050013 + 5500055050014.
It is an arithmetic number, because the mean of its divisors is an integer number (5500055050014).
Almost surely, 211000110100027 is an apocalyptic number.
11000110100027 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000110100027 is an equidigital number, since it uses as much as digits as its factorization.
11000110100027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 11000110100027 its reverse (72000101100011), we get a palindrome (83000211200038).
The spelling of 11000110100027 in words is "eleven trillion, one hundred ten million, one hundred thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •