Base | Representation |
---|---|
bin | 1001101001010010101101… |
… | …00100111001010100111100 |
3 | 2210002122201102212002020111 |
4 | 10310221112210321110330 |
5 | 10240001040230121340 |
6 | 113035423455155404 |
7 | 4316241412006165 |
oct | 464512644712474 |
9 | 83078642762214 |
10 | 21210001020220 |
11 | 68381246a56a1 |
12 | 2466782515b64 |
13 | bab12c85538c |
14 | 5347d8ad276c |
15 | 26bac2a81aea |
hex | 134a5693953c |
21210001020220 has 12 divisors (see below), whose sum is σ = 44541002142504. Its totient is φ = 8484000408080.
The previous prime is 21210001020209. The next prime is 21210001020233. The reversal of 21210001020220 is 2202010001212.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 21210001020220.
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, 530250025486 + ... + 530250025525.
It is an arithmetic number, because the mean of its divisors is an integer number (3711750178542).
Almost surely, 221210001020220 is an apocalyptic number.
21210001020220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21210001020220 is an abundant number, since it is smaller than the sum of its proper divisors (23331001122284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210001020220 is a wasteful number, since it uses less digits than its factorization.
21210001020220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1060500051020 (or 1060500051018 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 21210001020220 its reverse (2202010001212), we get a palindrome (23412011021432).
The spelling of 21210001020220 in words is "twenty-one trillion, two hundred ten billion, one million, twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •