Base | Representation |
---|---|
bin | 1001001001010011110111… |
… | …01100110000101000111000 |
3 | 2122012121021222200122200211 |
4 | 10210221323230300220320 |
5 | 10114000024211223000 |
6 | 110434530054240504 |
7 | 4143660052153666 |
oct | 444517354605070 |
9 | 78177258618624 |
10 | 20111112211000 |
11 | 6454090602798 |
12 | 2309802956134 |
13 | b2b615048655 |
14 | 4d755103bc36 |
15 | 24d2099277ba |
hex | 124a7bb30a38 |
20111112211000 has 64 divisors (see below), whose sum is σ = 47064283812000. Its totient is φ = 8043713049600.
The previous prime is 20111112210991. The next prime is 20111112211009. The reversal of 20111112211000 is 11221111102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20111112210991) and next prime (20111112211009).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111112211009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10149736 + ... + 11968264.
Almost surely, 220111112211000 is an apocalyptic number.
20111112211000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20111112211000 is an abundant number, since it is smaller than the sum of its proper divisors (26953171601000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111112211000 is a wasteful number, since it uses less digits than its factorization.
20111112211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1829609 (or 1829595 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20111112211000 its reverse (11221111102), we get a palindrome (20122333322102).
The spelling of 20111112211000 in words is "twenty trillion, one hundred eleven billion, one hundred twelve million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •