Base | Representation |
---|---|
bin | 1001001001010011111001… |
… | …10000101111101101101000 |
3 | 2122012121100020020002212220 |
4 | 10210221330300233231220 |
5 | 10114000043242024000 |
6 | 110434531532234040 |
7 | 4143660356512116 |
oct | 444517460575550 |
9 | 78177306202786 |
10 | 20111130033000 |
11 | 645409a675716 |
12 | 230980890b920 |
13 | b2b618948606 |
14 | 4d755355aab6 |
15 | 24d20b2981a0 |
hex | 124a7cc2fb68 |
20111130033000 has 128 divisors (see below), whose sum is σ = 66437709736320. Its totient is φ = 5047499289600.
The previous prime is 20111130032999. The next prime is 20111130033013. The reversal of 20111130033000 is 33003111102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 197116942 + ... + 197218941.
It is an arithmetic number, because the mean of its divisors is an integer number (519044607315).
Almost surely, 220111130033000 is an apocalyptic number.
20111130033000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20111130033000 is an abundant number, since it is smaller than the sum of its proper divisors (46326579703320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111130033000 is a wasteful number, since it uses less digits than its factorization.
20111130033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394335924 (or 394335910 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 20111130033000 its reverse (33003111102), we get a palindrome (20144133144102).
The spelling of 20111130033000 in words is "twenty trillion, one hundred eleven billion, one hundred thirty million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •