Base | Representation |
---|---|
bin | 1001100110011010101011… |
… | …00101010101010110110001 |
3 | 2202202012200211111210221102 |
4 | 10303031111211111112301 |
5 | 10231341214212010001 |
6 | 112522203524534145 |
7 | 4306143135065231 |
oct | 463152545252661 |
9 | 82665624453842 |
10 | 21111200110001 |
11 | 67aa234104491 |
12 | 244b5aa251355 |
13 | ba1a155aba21 |
14 | 52db05005cc1 |
15 | 26923dc52e6b |
hex | 1333559555b1 |
21111200110001 has 8 divisors (see below), whose sum is σ = 21231295261920. Its totient is φ = 20991128908288.
The previous prime is 21111200109953. The next prime is 21111200110009. The reversal of 21111200110001 is 10001100211112.
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 21111200110001 - 234 = 21094020240817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21111200110009) 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 7 ways as a sum of consecutive naturals, for example, 4218131 + ... + 7746936.
It is an arithmetic number, because the mean of its divisors is an integer number (2653911907740).
Almost surely, 221111200110001 is an apocalyptic number.
It is an amenable number.
21111200110001 is a deficient number, since it is larger than the sum of its proper divisors (120095151919).
21111200110001 is a wasteful number, since it uses less digits than its factorization.
21111200110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11975103.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21111200110001 its reverse (10001100211112), we get a palindrome (31112300321113).
The spelling of 21111200110001 in words is "twenty-one trillion, one hundred eleven billion, two hundred million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •