Base | Representation |
---|---|
bin | 1001100011110100111010… |
… | …11011100101011111111101 |
3 | 2202102201000001011211221122 |
4 | 10301322131123211133331 |
5 | 10223411442031413041 |
6 | 112413245343440325 |
7 | 4266542663615012 |
oct | 461723533453775 |
9 | 82381001154848 |
10 | 21022211201021 |
11 | 67755191a2008 |
12 | 24362b3bb60a5 |
13 | b965030aac74 |
14 | 5296a2501709 |
15 | 266c81548c4b |
hex | 131e9d6e57fd |
21022211201021 has 8 divisors (see below), whose sum is σ = 21056372064000. Its totient is φ = 20988077124240.
The previous prime is 21022211200999. The next prime is 21022211201041. The reversal of 21022211201021 is 12010211222012.
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 21022211201021 - 230 = 21021137459197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21022211201041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5125346 + ... + 8265203.
It is an arithmetic number, because the mean of its divisors is an integer number (2632046508000).
Almost surely, 221022211201021 is an apocalyptic number.
It is an amenable number.
21022211201021 is a deficient number, since it is larger than the sum of its proper divisors (34160862979).
21022211201021 is a wasteful number, since it uses less digits than its factorization.
21022211201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13393099.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21022211201021 its reverse (12010211222012), we get a palindrome (33032422423033).
The spelling of 21022211201021 in words is "twenty-one trillion, twenty-two billion, two hundred eleven million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •