Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …00010011001000001111100 |
3 | 2122011122012100002002211211 |
4 | 10210200201002121001330 |
5 | 10113313322303021340 |
6 | 110430134504454204 |
7 | 4143151356152524 |
oct | 444404102310174 |
9 | 78148170062754 |
10 | 20101001220220 |
11 | 644a87217a768 |
12 | 230786077a364 |
13 | b2a693369b7b |
14 | 4d6c72266684 |
15 | 24cd16e435ea |
hex | 12482109907c |
20101001220220 has 24 divisors (see below), whose sum is σ = 42250793811408. Its totient is φ = 8033030726400.
The previous prime is 20101001220173. The next prime is 20101001220343. The reversal of 20101001220220 is 2202210010102.
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 20101001220220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 460587741 + ... + 460631380.
It is an arithmetic number, because the mean of its divisors is an integer number (1760449742142).
Almost surely, 220101001220220 is an apocalyptic number.
20101001220220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20101001220220 is an abundant number, since it is smaller than the sum of its proper divisors (22149792591188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20101001220220 is a wasteful number, since it uses less digits than its factorization.
20101001220220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 921220221 (or 921220219 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20101001220220 its reverse (2202210010102), we get a palindrome (22303211230322).
The spelling of 20101001220220 in words is "twenty trillion, one hundred one billion, one million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •