Base | Representation |
---|---|
bin | 1001101111011101111101… |
… | …01000100101001000000110 |
3 | 2210211221102222002000121120 |
4 | 10313232332220211020012 |
5 | 10301440131223322042 |
6 | 113321120052254410 |
7 | 4340463043255656 |
oct | 467567650451006 |
9 | 83757388060546 |
10 | 21422200214022 |
11 | 690a1165aa743 |
12 | 249b923611406 |
13 | bc514937040a |
14 | 540ba9044366 |
15 | 272391ec1dec |
hex | 137bbea25206 |
21422200214022 has 32 divisors (see below), whose sum is σ = 43015233939552. Its totient is φ = 7112266481664.
The previous prime is 21422200214021. The next prime is 21422200214111. The reversal of 21422200214022 is 22041200222412.
It is a junction number, because it is equal to n+sod(n) for n = 21422200213983 and 21422200214001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21422200214021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15550318 + ... + 16871774.
It is an arithmetic number, because the mean of its divisors is an integer number (1344226060611).
Almost surely, 221422200214022 is an apocalyptic number.
21422200214022 is an abundant number, since it is smaller than the sum of its proper divisors (21593033725530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21422200214022 is a wasteful number, since it uses less digits than its factorization.
21422200214022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332232.
The product of its (nonzero) digits is 2048, while the sum is 24.
Adding to 21422200214022 its reverse (22041200222412), we get a palindrome (43463400436434).
The spelling of 21422200214022 in words is "twenty-one trillion, four hundred twenty-two billion, two hundred million, two hundred fourteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •