Base | Representation |
---|---|
bin | 11110100011110011000… |
… | …000110010100110110101 |
3 | 21102202112002012202100212 |
4 | 132203303000302212311 |
5 | 233401320401024341 |
6 | 4244423020315205 |
7 | 304502323631225 |
oct | 36436300624665 |
9 | 7382462182325 |
10 | 2100021111221 |
11 | 73a683196080 |
12 | 29abb89a2b05 |
13 | 123053555c57 |
14 | 738da648085 |
15 | 3995ded75eb |
hex | 1e8f30329b5 |
2100021111221 has 32 divisors (see below), whose sum is σ = 2374245457920. Its totient is φ = 1840186814400.
The previous prime is 2100021111211. The next prime is 2100021111241. The reversal of 2100021111221 is 1221111200012.
It is a de Polignac number, because none of the positive numbers 2k-2100021111221 is a prime.
It is a super-2 number, since 2×21000211112212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100021111196 and 2100021111205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100021111211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92431355 + ... + 92454071.
It is an arithmetic number, because the mean of its divisors is an integer number (74195170560).
Almost surely, 22100021111221 is an apocalyptic number.
It is an amenable number.
2100021111221 is a deficient number, since it is larger than the sum of its proper divisors (274224346699).
2100021111221 is a wasteful number, since it uses less digits than its factorization.
2100021111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23825.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2100021111221 its reverse (1221111200012), we get a palindrome (3321132311233).
The spelling of 2100021111221 in words is "two trillion, one hundred billion, twenty-one million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •