Base | Representation |
---|---|
bin | 1001100110011010010011… |
… | …01110001111110101101111 |
3 | 2202202012011222002002010111 |
4 | 10303031021232033311233 |
5 | 10231340312241320421 |
6 | 112522132055520451 |
7 | 4306135200515620 |
oct | 463151156176557 |
9 | 82665158062114 |
10 | 21111001120111 |
11 | 67aa141851431 |
12 | 244b553689127 |
13 | ba19b32b9426 |
14 | 52dac6807a47 |
15 | 26922b547ee1 |
hex | 133349b8fd6f |
21111001120111 has 8 divisors (see below), whose sum is σ = 24126927888800. Its totient is φ = 18095091717888.
The previous prime is 21111001120087. The next prime is 21111001120159. The reversal of 21111001120111 is 11102110011112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21111001120111 - 215 = 21111001087343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21111001120091 and 21111001120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21111001120211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1623246 + ... + 6697531.
It is an arithmetic number, because the mean of its divisors is an integer number (3015865986100).
Almost surely, 221111001120111 is an apocalyptic number.
21111001120111 is a deficient number, since it is larger than the sum of its proper divisors (3015926768689).
21111001120111 is an equidigital number, since it uses as much as digits as its factorization.
21111001120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8683233.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 21111001120111 its reverse (11102110011112), we get a palindrome (32213111131223).
The spelling of 21111001120111 in words is "twenty-one trillion, one hundred eleven billion, one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •