Base | Representation |
---|---|
bin | 1001100110101011011110… |
… | …01110010100101011001111 |
3 | 2202210001222110102212211122 |
4 | 10303111233032110223033 |
5 | 10232013202334020421 |
6 | 112530254545111155 |
7 | 4306612513544315 |
oct | 463255716245317 |
9 | 82701873385748 |
10 | 21120220220111 |
11 | 6803042790741 |
12 | 24512a70284bb |
13 | ba282228059c |
14 | 53031cd740b5 |
15 | 2695baaa32ab |
hex | 13356f394acf |
21120220220111 has 8 divisors (see below), whose sum is σ = 21416578825824. Its totient is φ = 20824051898880.
The previous prime is 21120220220089. The next prime is 21120220220123. The reversal of 21120220220111 is 11102202202112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21120220220111 - 214 = 21120220203727 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21120220220111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21120220220131) 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, 47347571 + ... + 47791556.
It is an arithmetic number, because the mean of its divisors is an integer number (2677072353228).
Almost surely, 221120220220111 is an apocalyptic number.
21120220220111 is a deficient number, since it is larger than the sum of its proper divisors (296358605713).
21120220220111 is an equidigital number, since it uses as much as digits as its factorization.
21120220220111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95142241.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21120220220111 its reverse (11102202202112), we get a palindrome (32222422422223).
The spelling of 21120220220111 in words is "twenty-one trillion, one hundred twenty billion, two hundred twenty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •