Base | Representation |
---|---|
bin | 1001101001100101101101… |
… | …00011001111010000001110 |
3 | 2210010122001022011111120220 |
4 | 10310302312203033100032 |
5 | 10240132432442224240 |
6 | 113044231551052210 |
7 | 4320052236355422 |
oct | 464626643172016 |
9 | 83118038144526 |
10 | 21220201133070 |
11 | 684148936a425 |
12 | 246874a511066 |
13 | bac096b39304 |
14 | 5350c5666b82 |
15 | 26bebd2bc5d0 |
hex | 134cb68cf40e |
21220201133070 has 64 divisors (see below), whose sum is σ = 51150176317440. Its totient is φ = 5634141182208.
The previous prime is 21220201132993. The next prime is 21220201133071. The reversal of 21220201133070 is 7033110202212.
It is a happy number.
It is a super-2 number, since 2×212202011330702 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21220201133070.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21220201133071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4676251 + ... + 8019209.
It is an arithmetic number, because the mean of its divisors is an integer number (799221504960).
Almost surely, 221220201133070 is an apocalyptic number.
21220201133070 is an abundant number, since it is smaller than the sum of its proper divisors (29929975184370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21220201133070 is a wasteful number, since it uses less digits than its factorization.
21220201133070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3343889.
The product of its (nonzero) digits is 1008, while the sum is 24.
Adding to 21220201133070 its reverse (7033110202212), we get a palindrome (28253311335282).
The spelling of 21220201133070 in words is "twenty-one trillion, two hundred twenty billion, two hundred one million, one hundred thirty-three thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •