Base | Representation |
---|---|
bin | 10011101010110111… |
… | …001101100100001011 |
3 | 2000111220101220010212 |
4 | 103222313031210023 |
5 | 321223233224321 |
6 | 13411423231335 |
7 | 1345243555541 |
oct | 235267154413 |
9 | 60456356125 |
10 | 21120211211 |
11 | 8a58899310 |
12 | 411514854b |
13 | 1cb77b3bc8 |
14 | 1044da5d91 |
15 | 83929555b |
hex | 4eadcd90b |
21120211211 has 8 divisors (see below), whose sum is σ = 23384115264. Its totient is φ = 18913621320.
The previous prime is 21120211207. The next prime is 21120211213. The reversal of 21120211211 is 11211202112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21120211211 - 22 = 21120211207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120211213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14327765 + ... + 14329238.
It is an arithmetic number, because the mean of its divisors is an integer number (2923014408).
Almost surely, 221120211211 is an apocalyptic number.
21120211211 is a deficient number, since it is larger than the sum of its proper divisors (2263904053).
21120211211 is a wasteful number, since it uses less digits than its factorization.
21120211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28657081.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21120211211 its reverse (11211202112), we get a palindrome (32331413323).
Subtracting from 21120211211 its reverse (11211202112), we obtain a palindrome (9909009099).
It can be divided in two parts, 211202112 and 11, that multiplied together give a palindrome (2323223232).
The spelling of 21120211211 in words is "twenty-one billion, one hundred twenty million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •