Base | Representation |
---|---|
bin | 10011101010011000… |
… | …101100011010101001 |
3 | 2000111100100110001221 |
4 | 103222120230122221 |
5 | 321214211223423 |
6 | 13410535542041 |
7 | 1345115555620 |
oct | 235230543251 |
9 | 60440313057 |
10 | 21112211113 |
11 | 8a54324764 |
12 | 411252a921 |
13 | 1cb5c42716 |
14 | 1043cc26b7 |
15 | 838714e5d |
hex | 4ea62c6a9 |
21112211113 has 8 divisors (see below), whose sum is σ = 24135851840. Its totient is φ = 18090473040.
The previous prime is 21112211059. The next prime is 21112211119. The reversal of 21112211113 is 31111221112.
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 a de Polignac number, because none of the positive numbers 2k-21112211113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21112211119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451803 + ... + 496336.
It is an arithmetic number, because the mean of its divisors is an integer number (3016981480).
Almost surely, 221112211113 is an apocalyptic number.
It is an amenable number.
21112211113 is a deficient number, since it is larger than the sum of its proper divisors (3023640727).
21112211113 is an equidigital number, since it uses as much as digits as its factorization.
21112211113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951327.
The product of its digits is 24, while the sum is 16.
Adding to 21112211113 its reverse (31111221112), we get a palindrome (52223432225).
Subtracting 21112211113 from its reverse (31111221112), we obtain a palindrome (9999009999).
The spelling of 21112211113 in words is "twenty-one billion, one hundred twelve million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •