Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …0100010011010110101101 |
3 | 1110000111211111112200220112 |
4 | 2200113101310103112231 |
5 | 2421023141440410044 |
6 | 35234322541425405 |
7 | 2215114426122512 |
oct | 240272164232655 |
9 | 43014744480815 |
10 | 11020111263149 |
11 | 356966a57264a |
12 | 129b930b6b265 |
13 | 61c265b86c71 |
14 | 2a153a541309 |
15 | 1419d20a209e |
hex | a05d1d135ad |
11020111263149 has 2 divisors, whose sum is σ = 11020111263150. Its totient is φ = 11020111263148.
The previous prime is 11020111263121. The next prime is 11020111263157. The reversal of 11020111263149 is 94136211102011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8728272553225 + 2291838709924 = 2954365^2 + 1513882^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020111263149 - 28 = 11020111262893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020111266149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510055631574 + 5510055631575.
It is an arithmetic number, because the mean of its divisors is an integer number (5510055631575).
Almost surely, 211020111263149 is an apocalyptic number.
It is an amenable number.
11020111263149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020111263149 is an equidigital number, since it uses as much as digits as its factorization.
11020111263149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 32.
The spelling of 11020111263149 in words is "eleven trillion, twenty billion, one hundred eleven million, two hundred sixty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •