Base | Representation |
---|---|
bin | 1010000000010010100110… |
… | …1001111011000111111101 |
3 | 1102221121012120211101110211 |
4 | 2200010221221323013331 |
5 | 2420211211141212424 |
6 | 35221214131232421 |
7 | 2213505661055422 |
oct | 240045151730775 |
9 | 42847176741424 |
10 | 11000110100989 |
11 | 356113641a469 |
12 | 1297a8a748711 |
13 | 61a3c9193379 |
14 | 2a05a0035d49 |
15 | 1412111a6b94 |
hex | a0129a7b1fd |
11000110100989 has 2 divisors, whose sum is σ = 11000110100990. Its totient is φ = 11000110100988.
The previous prime is 11000110100981. The next prime is 11000110101089. The reversal of 11000110100989 is 98900101100011.
11000110100989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9763543860889 + 1236566240100 = 3124667^2 + 1112010^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000110100989 - 23 = 11000110100981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11000110100989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000110100981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500055050494 + 5500055050495.
It is an arithmetic number, because the mean of its divisors is an integer number (5500055050495).
Almost surely, 211000110100989 is an apocalyptic number.
It is an amenable number.
11000110100989 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000110100989 is an equidigital number, since it uses as much as digits as its factorization.
11000110100989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 31.
The spelling of 11000110100989 in words is "eleven trillion, one hundred ten million, one hundred thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •