Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …1010100110000011101000 |
3 | 1102222201221202100122102210 |
4 | 2200033233222212003220 |
5 | 2420410110124201300 |
6 | 35230504134525120 |
7 | 2214410113304202 |
oct | 240175752460350 |
9 | 42881852318383 |
10 | 11012022100200 |
11 | 3566199435810 |
12 | 129a253b067a0 |
13 | 61b577025c04 |
14 | 2a0db00a7772 |
15 | 1416abd43050 |
hex | a03efaa60e8 |
11012022100200 has 192 divisors, whose sum is σ = 37417157291520. Its totient is φ = 2656928736000.
The previous prime is 11012022100187. The next prime is 11012022100213. The reversal of 11012022100200 is 200122021011.
It is an interprime number because it is at equal distance from previous prime (11012022100187) and next prime (11012022100213).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2561164 + ... + 5346363.
It is an arithmetic number, because the mean of its divisors is an integer number (194881027560).
Almost surely, 211012022100200 is an apocalyptic number.
11012022100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012022100200 is an abundant number, since it is smaller than the sum of its proper divisors (26405135191320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012022100200 is a wasteful number, since it uses less digits than its factorization.
11012022100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7907768 (or 7907759 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11012022100200 its reverse (200122021011), we get a palindrome (11212144121211).
The spelling of 11012022100200 in words is "eleven trillion, twelve billion, twenty-two million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •