Base | Representation |
---|---|
bin | 10100101001111011… |
… | …00101111110110001 |
3 | 1001121211010002200112 |
4 | 22110331211332301 |
5 | 140202302441123 |
6 | 5032210031105 |
7 | 541540604411 |
oct | 122475457661 |
9 | 31554102615 |
10 | 11089108913 |
11 | 4780570723 |
12 | 2195878495 |
13 | 1079526b0c |
14 | 772a68641 |
15 | 44d7e1d78 |
hex | 294f65fb1 |
11089108913 has 2 divisors, whose sum is σ = 11089108914. Its totient is φ = 11089108912.
The previous prime is 11089108907. The next prime is 11089108949. The reversal of 11089108913 is 31980198011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9782792464 + 1306316449 = 98908^2 + 36143^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11089108913 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 (11089108903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5544554456 + 5544554457.
It is an arithmetic number, because the mean of its divisors is an integer number (5544554457).
Almost surely, 211089108913 is an apocalyptic number.
It is an amenable number.
11089108913 is a deficient number, since it is larger than the sum of its proper divisors (1).
11089108913 is an equidigital number, since it uses as much as digits as its factorization.
11089108913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 41.
The spelling of 11089108913 in words is "eleven billion, eighty-nine million, one hundred eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •