Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …1011000001100101011101 |
3 | 1102221121012000120212100211 |
4 | 2200010221023001211131 |
5 | 2420211202103012424 |
6 | 35221213241452421 |
7 | 2213505532161313 |
oct | 240045113014535 |
9 | 42847160525324 |
10 | 11000102000989 |
11 | 3561131897852 |
12 | 1297a87aa1111 |
13 | 61a3c75b857a |
14 | 2a059cd280b3 |
15 | 141210606b94 |
hex | a01292c195d |
11000102000989 has 2 divisors, whose sum is σ = 11000102000990. Its totient is φ = 11000102000988.
The previous prime is 11000102000983. The next prime is 11000102001001. The reversal of 11000102000989 is 98900020100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10747939344025 + 252162656964 = 3278405^2 + 502158^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000102000989 - 25 = 11000102000957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11000102000989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000102000983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500051000494 + 5500051000495.
It is an arithmetic number, because the mean of its divisors is an integer number (5500051000495).
Almost surely, 211000102000989 is an apocalyptic number.
It is an amenable number.
11000102000989 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000102000989 is an equidigital number, since it uses as much as digits as its factorization.
11000102000989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 11000102000989 in words is "eleven trillion, one hundred two million, nine hundred eighty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •