Base | Representation |
---|---|
bin | 1001101001000000010010… |
… | …00110010011010110001111 |
3 | 2210001201012012110011221120 |
4 | 10310200021012103112033 |
5 | 10234320311433020421 |
6 | 113031110250332023 |
7 | 4315441343050545 |
oct | 464401106232617 |
9 | 83051165404846 |
10 | 21200111220111 |
11 | 6833a0a10947a |
12 | 246488242a013 |
13 | baa214940255 |
14 | 53413b457d95 |
15 | 26b6e46e08c6 |
hex | 13480919358f |
21200111220111 has 8 divisors (see below), whose sum is σ = 28352213193984. Its totient is φ = 14090708363160.
The previous prime is 21200111220031. The next prime is 21200111220187. The reversal of 21200111220111 is 11102211100212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21200111220111 - 243 = 12404018197903 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21200111220191) 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, 10674778071 + ... + 10674780056.
It is an arithmetic number, because the mean of its divisors is an integer number (3544026649248).
Almost surely, 221200111220111 is an apocalyptic number.
21200111220111 is a deficient number, since it is larger than the sum of its proper divisors (7152101973873).
21200111220111 is a wasteful number, since it uses less digits than its factorization.
21200111220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21349558461.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21200111220111 its reverse (11102211100212), we get a palindrome (32302322320323).
The spelling of 21200111220111 in words is "twenty-one trillion, two hundred billion, one hundred eleven million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •