Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1001010100100010011001 |
3 | 1110022011120210201012111212 |
4 | 2201201320021110202121 |
5 | 2423331213031432301 |
6 | 35335211105232505 |
7 | 2223651403303562 |
oct | 241417011244231 |
9 | 43264523635455 |
10 | 11100211202201 |
11 | 359a633929390 |
12 | 12b3366332735 |
13 | 62698c9108c4 |
14 | 2a5378693169 |
15 | 143b1e2124bb |
hex | a1878254899 |
11100211202201 has 16 divisors (see below), whose sum is σ = 12244099515648. Its totient is φ = 9978954969600.
The previous prime is 11100211202191. The next prime is 11100211202207. The reversal of 11100211202201 is 10220211200111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11100211202201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11100211202207) 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 in 15 ways as a sum of consecutive naturals, for example, 2912030 + ... + 5538983.
It is an arithmetic number, because the mean of its divisors is an integer number (765256219728).
Almost surely, 211100211202201 is an apocalyptic number.
11100211202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11100211202201 is a deficient number, since it is larger than the sum of its proper divisors (1143888313447).
11100211202201 is a wasteful number, since it uses less digits than its factorization.
11100211202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8452352.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11100211202201 its reverse (10220211200111), we get a palindrome (21320422402312).
The spelling of 11100211202201 in words is "eleven trillion, one hundred billion, two hundred eleven million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •