Base | Representation |
---|---|
bin | 1010000000100110111010… |
… | …00011100011001100010101 |
3 | 2212221020112212122210021221 |
4 | 11000103131003203030111 |
5 | 10341112234001320041 |
6 | 114451434111210341 |
7 | 4431152046340255 |
oct | 500233503431425 |
9 | 85836485583257 |
10 | 22011121120021 |
11 | 7016956052a00 |
12 | 2575a9bb169b1 |
13 | c3884189c3a7 |
14 | 5614b5b09965 |
15 | 28285e37a2d1 |
hex | 1404dd0e3315 |
22011121120021 has 12 divisors (see below), whose sum is σ = 24238272720256. Its totient is φ = 19973528494920.
The previous prime is 22011121119983. The next prime is 22011121120057. The reversal of 22011121120021 is 12002112111022.
It is not a de Polignac number, because 22011121120021 - 27 = 22011121119893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22011121119977 and 22011121120004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011121120061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 166213605 + ... + 166345978.
Almost surely, 222011121120021 is an apocalyptic number.
It is an amenable number.
22011121120021 is a deficient number, since it is larger than the sum of its proper divisors (2227151600235).
22011121120021 is a wasteful number, since it uses less digits than its factorization.
22011121120021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332560152 (or 332560141 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 22011121120021 its reverse (12002112111022), we get a palindrome (34013233231043).
The spelling of 22011121120021 in words is "twenty-two trillion, eleven billion, one hundred twenty-one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •