Base | Representation |
---|---|
bin | 1001100110101011000101… |
… | …10000101010110111101111 |
3 | 2202210001102212222111120012 |
4 | 10303111202300222313233 |
5 | 10232012240321320421 |
6 | 112530222115243435 |
7 | 4306604364326321 |
oct | 463254260526757 |
9 | 82701385874505 |
10 | 21120011120111 |
11 | 6802a45752822 |
12 | 2451248ba957b |
13 | ba27bab5b287 |
14 | 5302dd2a3611 |
15 | 2695a754c95b |
hex | 133562c2adef |
21120011120111 has 4 divisors (see below), whose sum is σ = 21153481819824. Its totient is φ = 21086540420400.
The previous prime is 21120011120107. The next prime is 21120011120129. The reversal of 21120011120111 is 11102111002112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21120011120111 - 22 = 21120011120107 is a prime.
It is a super-2 number, since 2×211200111201112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21120011120011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16735348910 + ... + 16735350171.
It is an arithmetic number, because the mean of its divisors is an integer number (5288370454956).
Almost surely, 221120011120111 is an apocalyptic number.
21120011120111 is a deficient number, since it is larger than the sum of its proper divisors (33470699713).
21120011120111 is an equidigital number, since it uses as much as digits as its factorization.
21120011120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33470699712.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21120011120111 its reverse (11102111002112), we get a palindrome (32222122122223).
The spelling of 21120011120111 in words is "twenty-one trillion, one hundred twenty billion, eleven million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •