Base | Representation |
---|---|
bin | 1001101001100101101101… |
… | …00010101110110000010001 |
3 | 2210010122001021220201222122 |
4 | 10310302312202232300101 |
5 | 10240132432423444303 |
6 | 113044231544144025 |
7 | 4320052235262344 |
oct | 464626642566021 |
9 | 83118037821878 |
10 | 21220200999953 |
11 | 684148928940a |
12 | 246874a468015 |
13 | bac096ac0847 |
14 | 5350c563045b |
15 | 26bebd292e38 |
hex | 134cb68aec11 |
21220200999953 has 2 divisors, whose sum is σ = 21220200999954. Its totient is φ = 21220200999952.
The previous prime is 21220200999923. The next prime is 21220200999961. The reversal of 21220200999953 is 35999900202212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12693059303824 + 8527141696129 = 3562732^2 + 2920127^2 .
It is a cyclic number.
It is not a de Polignac number, because 21220200999953 - 224 = 21220184222737 is a prime.
It is a super-2 number, since 2×212202009999532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21220200999895 and 21220200999904.
It is not a weakly prime, because it can be changed into another prime (21220200999913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610100499976 + 10610100499977.
It is an arithmetic number, because the mean of its divisors is an integer number (10610100499977).
Almost surely, 221220200999953 is an apocalyptic number.
It is an amenable number.
21220200999953 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220200999953 is an equidigital number, since it uses as much as digits as its factorization.
21220200999953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1574640, while the sum is 53.
The spelling of 21220200999953 in words is "twenty-one trillion, two hundred twenty billion, two hundred million, nine hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •