Base | Representation |
---|---|
bin | 10100100000100111… |
… | …01011001001001101 |
3 | 1001102101011022200202 |
4 | 22100103223021031 |
5 | 140022304324044 |
6 | 5020340103245 |
7 | 536602023215 |
oct | 122023531115 |
9 | 31371138622 |
10 | 11011011149 |
11 | 4740479716 |
12 | 2173694b25 |
13 | 10662b1518 |
14 | 766539245 |
15 | 446a16c4e |
hex | 2904eb24d |
11011011149 has 2 divisors, whose sum is σ = 11011011150. Its totient is φ = 11011011148.
The previous prime is 11011011059. The next prime is 11011011173. The reversal of 11011011149 is 94111011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10466722249 + 544288900 = 102307^2 + 23330^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011011149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011011149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011010149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505505574 + 5505505575.
It is an arithmetic number, because the mean of its divisors is an integer number (5505505575).
Almost surely, 211011011149 is an apocalyptic number.
It is an amenable number.
11011011149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011011149 is an equidigital number, since it uses as much as digits as its factorization.
11011011149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 11011011149 in words is "eleven billion, eleven million, eleven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •