Base | Representation |
---|---|
bin | 1001100110011100001011… |
… | …11011000011011011011111 |
3 | 2202202021210100112212221112 |
4 | 10303032011323003123133 |
5 | 10231344344321010421 |
6 | 112522420215252235 |
7 | 4306202213345105 |
oct | 463160573033337 |
9 | 82667710485845 |
10 | 21112011110111 |
11 | 67aa60a978909 |
12 | 244b79597a07b |
13 | ba1b1461374c |
14 | 52db809d5c75 |
15 | 26928a04e45b |
hex | 133385ec36df |
21112011110111 has 8 divisors (see below), whose sum is σ = 21184408810320. Its totient is φ = 21039615744192.
The previous prime is 21112011110087. The next prime is 21112011110171. The reversal of 21112011110111 is 11101111021112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21112011110111 is a prime.
It is a super-2 number, since 2×211120111101112 (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 (21112011110171) 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, 18617051 + ... + 19718483.
It is an arithmetic number, because the mean of its divisors is an integer number (2648051101290).
Almost surely, 221112011110111 is an apocalyptic number.
21112011110111 is a deficient number, since it is larger than the sum of its proper divisors (72397700209).
21112011110111 is a wasteful number, since it uses less digits than its factorization.
21112011110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1167145.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 21112011110111 its reverse (11101111021112), we get a palindrome (32213122131223).
The spelling of 21112011110111 in words is "twenty-one trillion, one hundred twelve billion, eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •