Base | Representation |
---|---|
bin | 1010000000111000001110… |
… | …1110001110000000100101 |
3 | 1102222120021112122212012211 |
4 | 2200032003232032000211 |
5 | 2420342403021022244 |
6 | 35230004323043421 |
7 | 2214314203200151 |
oct | 240160356160045 |
9 | 42876245585184 |
10 | 11010211110949 |
11 | 356544a155786 |
12 | 1299a29510571 |
13 | 61b348a88c3b |
14 | 2a0c7b770061 |
15 | 141602d68934 |
hex | a0383b8e025 |
11010211110949 has 2 divisors, whose sum is σ = 11010211110950. Its totient is φ = 11010211110948.
The previous prime is 11010211110923. The next prime is 11010211111033. The reversal of 11010211110949 is 94901111201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10595558826724 + 414652284225 = 3255082^2 + 643935^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010211110949 - 213 = 11010211102757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11010211110949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010211110919) 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, 5505105555474 + 5505105555475.
It is an arithmetic number, because the mean of its divisors is an integer number (5505105555475).
Almost surely, 211010211110949 is an apocalyptic number.
It is an amenable number.
11010211110949 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010211110949 is an equidigital number, since it uses as much as digits as its factorization.
11010211110949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 31.
The spelling of 11010211110949 in words is "eleven trillion, ten billion, two hundred eleven million, one hundred ten thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •