Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …01111111101011111011111 |
3 | 2202202002122121010012102111 |
4 | 10303030033033331133133 |
5 | 10231331310121231421 |
6 | 112521450453134451 |
7 | 4306101656144053 |
oct | 463141717753737 |
9 | 82662577105374 |
10 | 21110020102111 |
11 | 67a9789013056 |
12 | 244b31b02a427 |
13 | ba1887c971c5 |
14 | 52da323dbc63 |
15 | 2691c0365ee1 |
hex | 13330f3fd7df |
21110020102111 has 8 divisors (see below), whose sum is σ = 21838300786800. Its totient is φ = 20381762681280.
The previous prime is 21110020102109. The next prime is 21110020102123. The reversal of 21110020102111 is 11120102001112.
It is a happy number.
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 21110020102111 - 21 = 21110020102109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110020102091 and 21110020102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110020102811) 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, 3959781 + ... + 7609198.
It is an arithmetic number, because the mean of its divisors is an integer number (2729787598350).
Almost surely, 221110020102111 is an apocalyptic number.
21110020102111 is a deficient number, since it is larger than the sum of its proper divisors (728280684689).
21110020102111 is a wasteful number, since it uses less digits than its factorization.
21110020102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11631929.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21110020102111 its reverse (11120102001112), we get a palindrome (32230122103223).
The spelling of 21110020102111 in words is "twenty-one trillion, one hundred ten billion, twenty million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •