Base | Representation |
---|---|
bin | 1010001100100000111000… |
… | …0110011011111101111001 |
3 | 1110200200020020011001022210 |
4 | 2203020032012123331321 |
5 | 2432131241402223001 |
6 | 35501503245405333 |
7 | 2234621521050150 |
oct | 243101606337571 |
9 | 43620206131283 |
10 | 11210101211001 |
11 | 36321a4983480 |
12 | 1310714269849 |
13 | 6341533a9454 |
14 | 2aa801004597 |
15 | 14690182edd6 |
hex | a320e19bf79 |
11210101211001 has 16 divisors (see below), whose sum is σ = 18634973442048. Its totient is φ = 5823429200400.
The previous prime is 11210101210933. The next prime is 11210101211027. The reversal of 11210101211001 is 10011210101211.
It is not a de Polignac number, because 11210101211001 - 222 = 11210097016697 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11210101211041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24264288105 + ... + 24264288566.
It is an arithmetic number, because the mean of its divisors is an integer number (1164685840128).
Almost surely, 211210101211001 is an apocalyptic number.
11210101211001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11210101211001 is a deficient number, since it is larger than the sum of its proper divisors (7424872231047).
11210101211001 is a wasteful number, since it uses less digits than its factorization.
11210101211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48528576692.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11210101211001 its reverse (10011210101211), we get a palindrome (21221311312212).
The spelling of 11210101211001 in words is "eleven trillion, two hundred ten billion, one hundred one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •