Base | Representation |
---|---|
bin | 1001100110011010010101… |
… | …11110010100100111101011 |
3 | 2202202012020102120112111122 |
4 | 10303031022332110213223 |
5 | 10231340333130024321 |
6 | 112522134125445455 |
7 | 4306135544113304 |
oct | 463151276244753 |
9 | 82665212515448 |
10 | 21111022111211 |
11 | 67aa15268934a |
12 | 244b55a71088b |
13 | ba19b77589b6 |
14 | 52dac950d7ab |
15 | 26922d2e28ab |
hex | 13334af949eb |
21111022111211 has 4 divisors (see below), whose sum is σ = 21111298174032. Its totient is φ = 21110746048392.
The previous prime is 21111022111189. The next prime is 21111022111217. The reversal of 21111022111211 is 11211122011112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21111022111211 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 21111022111211.
It is not an unprimeable number, because it can be changed into a prime (21111022111217) 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, 137916671 + ... + 138069656.
It is an arithmetic number, because the mean of its divisors is an integer number (5277824543508).
Almost surely, 221111022111211 is an apocalyptic number.
21111022111211 is a deficient number, since it is larger than the sum of its proper divisors (276062821).
21111022111211 is an equidigital number, since it uses as much as digits as its factorization.
21111022111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276062820.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 21111022111211 its reverse (11211122011112), we get a palindrome (32322144122323).
The spelling of 21111022111211 in words is "twenty-one trillion, one hundred eleven billion, twenty-two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •