Base | Representation |
---|---|
bin | 1001100110011100011000… |
… | …11011001111011010011101 |
3 | 2202202022001221211210100221 |
4 | 10303032030123033122131 |
5 | 10231400110233223401 |
6 | 112522435113521341 |
7 | 4306205006603563 |
oct | 463161433173235 |
9 | 82668057753327 |
10 | 21112120211101 |
11 | 67aa666516017 |
12 | 244b806413251 |
13 | ba1b310c284a |
14 | 52db912b5a33 |
15 | 2692949007a1 |
hex | 13338c6cf69d |
21112120211101 has 4 divisors (see below), whose sum is σ = 21112138650400. Its totient is φ = 21112101771804.
The previous prime is 21112120211087. The next prime is 21112120211123. The reversal of 21112120211101 is 10111202121112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21112120211101 - 29 = 21112120210589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21112120211401) 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, 7379841 + ... + 9832918.
It is an arithmetic number, because the mean of its divisors is an integer number (5278034662600).
Almost surely, 221112120211101 is an apocalyptic number.
It is an amenable number.
21112120211101 is a deficient number, since it is larger than the sum of its proper divisors (18439299).
21112120211101 is a wasteful number, since it uses less digits than its factorization.
21112120211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18439298.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 21112120211101 its reverse (10111202121112), we get a palindrome (31223322332213).
The spelling of 21112120211101 in words is "twenty-one trillion, one hundred twelve billion, one hundred twenty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •