Base | Representation |
---|---|
bin | 1001001001000001011100… |
… | …00101011011011000111000 |
3 | 2122011122202120222101001112 |
4 | 10210200232011123120320 |
5 | 10113314244322320440 |
6 | 110430212324335452 |
7 | 4143156654604616 |
oct | 444405605333070 |
9 | 78148676871045 |
10 | 20101220120120 |
11 | 644a9747a1477 |
12 | 2307901b44588 |
13 | b2a6c9810939 |
14 | 4d6c933686b6 |
15 | 24cd2b282965 |
hex | 12482e15b638 |
20101220120120 has 16 divisors (see below), whose sum is σ = 45227745270360. Its totient is φ = 8040488048032.
The previous prime is 20101220120041. The next prime is 20101220120171. The reversal of 20101220120120 is 2102102210102.
It is a junction number, because it is equal to n+sod(n) for n = 20101220120095 and 20101220120104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 251265251462 + ... + 251265251541.
Almost surely, 220101220120120 is an apocalyptic number.
20101220120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20101220120120 is an abundant number, since it is smaller than the sum of its proper divisors (25126525150240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20101220120120 is a wasteful number, since it uses less digits than its factorization.
20101220120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502530503014 (or 502530503010 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20101220120120 its reverse (2102102210102), we get a palindrome (22203322330222).
The spelling of 20101220120120 in words is "twenty trillion, one hundred one billion, two hundred twenty million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •