Base | Representation |
---|---|
bin | 1001001001010100000100… |
… | …01000011001100111000000 |
3 | 2122012121120111202000000110 |
4 | 10210222002020121213000 |
5 | 10114000234322320000 |
6 | 110434544511151320 |
7 | 4143662532316332 |
oct | 444520210314700 |
9 | 78177514660013 |
10 | 20111220120000 |
11 | 6454136506389 |
12 | 2309832b15540 |
13 | b2b6314cb029 |
14 | 4d75614cb452 |
15 | 24d214140850 |
hex | 124a822199c0 |
20111220120000 has 140 divisors (see below), whose sum is σ = 66492386731496. Its totient is φ = 5362992000000.
The previous prime is 20111220119951. The next prime is 20111220120007. The reversal of 20111220120000 is 2102211102.
It is a super-2 number, since 2×201112201200002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111220120007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 83676751 + ... + 83916750.
Almost surely, 220111220120000 is an apocalyptic number.
20111220120000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20111220120000 is an abundant number, since it is smaller than the sum of its proper divisors (46381166611496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111220120000 is an equidigital number, since it uses as much as digits as its factorization.
20111220120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167593536 (or 167593511 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20111220120000 its reverse (2102211102), we get a palindrome (20113322331102).
The spelling of 20111220120000 in words is "twenty trillion, one hundred eleven billion, two hundred twenty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •