Base | Representation |
---|---|
bin | 1001100011001011111101… |
… | …01110011110000011110111 |
3 | 2202100121020112011010110021 |
4 | 10301211332232132003313 |
5 | 10223031423113033421 |
6 | 112355211330110011 |
7 | 4265134026101266 |
oct | 461457656360367 |
9 | 82317215133407 |
10 | 21000221221111 |
11 | 676716444a6a0 |
12 | 2431b9771b307 |
13 | b9440a356a32 |
14 | 5285b7c0c5dd |
15 | 2663e5c49341 |
hex | 13197eb9e0f7 |
21000221221111 has 4 divisors (see below), whose sum is σ = 22909332241224. Its totient is φ = 19091110201000.
The previous prime is 21000221221099. The next prime is 21000221221123. The reversal of 21000221221111 is 11112212200012.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (21000221221099) and next prime (21000221221123).
It is a cyclic number.
It is not a de Polignac number, because 21000221221111 - 25 = 21000221221079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000221221141) 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, 954555510040 + ... + 954555510061.
It is an arithmetic number, because the mean of its divisors is an integer number (5727333060306).
Almost surely, 221000221221111 is an apocalyptic number.
21000221221111 is a deficient number, since it is larger than the sum of its proper divisors (1909111020113).
21000221221111 is a wasteful number, since it uses less digits than its factorization.
21000221221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1909111020112.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21000221221111 its reverse (11112212200012), we get a palindrome (32112433421123).
The spelling of 21000221221111 in words is "twenty-one trillion, two hundred twenty-one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •