Base | Representation |
---|---|
bin | 1001100011011110100011… |
… | …01000100011000011011100 |
3 | 2202101120000002221221002221 |
4 | 10301233101220203003130 |
5 | 10223212343220042340 |
6 | 112403541551155124 |
7 | 4265636252215216 |
oct | 461572150430334 |
9 | 82346002857087 |
10 | 21010202112220 |
11 | 67704163a2932 |
12 | 2433b02215aa4 |
13 | b9533b0b3569 |
14 | 528c835d95b6 |
15 | 2667cc0d044a |
hex | 131bd1a230dc |
21010202112220 has 12 divisors (see below), whose sum is σ = 44121424435704. Its totient is φ = 8404080844880.
The previous prime is 21010202112197. The next prime is 21010202112259. The reversal of 21010202112220 is 2221120201012.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 21010202112194 and 21010202112203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 525255052786 + ... + 525255052825.
It is an arithmetic number, because the mean of its divisors is an integer number (3676785369642).
Almost surely, 221010202112220 is an apocalyptic number.
21010202112220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21010202112220 is an abundant number, since it is smaller than the sum of its proper divisors (23111222323484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21010202112220 is a wasteful number, since it uses less digits than its factorization.
21010202112220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050510105620 (or 1050510105618 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21010202112220 its reverse (2221120201012), we get a palindrome (23231322313232).
The spelling of 21010202112220 in words is "twenty-one trillion, ten billion, two hundred two million, one hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •