Base | Representation |
---|---|
bin | 1001101001010010111011… |
… | …10010110100010100000011 |
3 | 2210002200000212201002110222 |
4 | 10310221131302310110003 |
5 | 10240001312230011321 |
6 | 113035443502413255 |
7 | 4316244412160216 |
oct | 464513562642403 |
9 | 83080025632428 |
10 | 21210122110211 |
11 | 6838186a91371 |
12 | 24667b6b9122b |
13 | bab14b971468 |
14 | 53480ac1377d |
15 | 26bacd5003ab |
hex | 134a5dcb4503 |
21210122110211 has 4 divisors (see below), whose sum is σ = 21286692948432. Its totient is φ = 21133551271992.
The previous prime is 21210122110201. The next prime is 21210122110231. The reversal of 21210122110211 is 11201122101212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21210122110211 - 214 = 21210122093827 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 21210122110211.
It is not an unprimeable number, because it can be changed into a prime (21210122110201) 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, 38285418695 + ... + 38285419248.
It is an arithmetic number, because the mean of its divisors is an integer number (5321673237108).
Almost surely, 221210122110211 is an apocalyptic number.
21210122110211 is a deficient number, since it is larger than the sum of its proper divisors (76570838221).
21210122110211 is an equidigital number, since it uses as much as digits as its factorization.
21210122110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76570838220.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21210122110211 its reverse (11201122101212), we get a palindrome (32411244211423).
The spelling of 21210122110211 in words is "twenty-one trillion, two hundred ten billion, one hundred twenty-two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •