Base | Representation |
---|---|
bin | 1001001001010010001010… |
… | …11100100111101001101100 |
3 | 2122012111221112222122221211 |
4 | 10210221011130213221230 |
5 | 10113441143203311340 |
6 | 110434255501404204 |
7 | 4143625360451260 |
oct | 444510534475154 |
9 | 78174845878854 |
10 | 20110202010220 |
11 | 6453763843443 |
12 | 23095a9b69664 |
13 | b2b4cb5bcbca |
14 | 4d74a61c80a0 |
15 | 24d1a4a835ea |
hex | 124a45727a6c |
20110202010220 has 48 divisors (see below), whose sum is σ = 50362940694528. Its totient is φ = 6595146993600.
The previous prime is 20110202010163. The next prime is 20110202010313. The reversal of 20110202010220 is 2201020201102.
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 20110202010220.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3122698956 + ... + 3122705395.
It is an arithmetic number, because the mean of its divisors is an integer number (1049227931136).
Almost surely, 220110202010220 is an apocalyptic number.
20110202010220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110202010220 is an abundant number, since it is smaller than the sum of its proper divisors (30252738684308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110202010220 is a wasteful number, since it uses less digits than its factorization.
20110202010220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6245404390 (or 6245404388 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20110202010220 its reverse (2201020201102), we get a palindrome (22311222211322).
The spelling of 20110202010220 in words is "twenty trillion, one hundred ten billion, two hundred two million, ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •