Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …1011101000001100001100 |
3 | 1102221121110122002022100210 |
4 | 2200010233223220030030 |
5 | 2420211413032223040 |
6 | 35221232142322420 |
7 | 2213511326353023 |
oct | 240045753501414 |
9 | 42847418068323 |
10 | 11000211211020 |
11 | 35611884a9979 |
12 | 1297ab8589410 |
13 | 61a4141051a5 |
14 | 2a05ad6358ba |
15 | 141219eca480 |
hex | a012fae830c |
11000211211020 has 48 divisors (see below), whose sum is σ = 30800780978688. Its totient is φ = 2933371600320.
The previous prime is 11000211211013. The next prime is 11000211211091. The reversal of 11000211211020 is 2011211200011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11000211210987 and 11000211211005.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11340397 + ... + 12272123.
It is an arithmetic number, because the mean of its divisors is an integer number (641682937056).
Almost surely, 211000211211020 is an apocalyptic number.
11000211211020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000211211020 is an abundant number, since it is smaller than the sum of its proper divisors (19800569767668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000211211020 is a wasteful number, since it uses less digits than its factorization.
11000211211020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1128510 (or 1128508 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11000211211020 its reverse (2011211200011), we get a palindrome (13011422411031).
The spelling of 11000211211020 in words is "eleven trillion, two hundred eleven million, two hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •