Base | Representation |
---|---|
bin | 1001001001000001011100… |
… | …00100111110000100000000 |
3 | 2122011122202120202021021122 |
4 | 10210200232010332010000 |
5 | 10113314244310000000 |
6 | 110430212322011412 |
7 | 4143156653564456 |
oct | 444405604760400 |
9 | 78148676667248 |
10 | 20101220000000 |
11 | 644a97471a1a7 |
12 | 2307901aa6b68 |
13 | b2a6c979b069 |
14 | 4d6c933369d6 |
15 | 24cd2b25c085 |
hex | 12482e13e100 |
20101220000000 has 288 divisors, whose sum is σ = 50390858499072. Its totient is φ = 8002656000000.
The previous prime is 20101219999999. The next prime is 20101220000023. The reversal of 20101220000000 is 2210102.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4459997747 + ... + 4460002253.
Almost surely, 220101220000000 is an apocalyptic number.
20101220000000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20101220000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25195429249536).
20101220000000 is an abundant number, since it is smaller than the sum of its proper divisors (30289638499072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20101220000000 is an frugal number, since it uses more digits than its factorization.
20101220000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4781 (or 4737 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 20101220000000 its reverse (2210102), we get a palindrome (20101222210102).
The spelling of 20101220000000 in words is "twenty trillion, one hundred one billion, two hundred twenty million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •