Base | Representation |
---|---|
bin | 1010001100101000110001… |
… | …1001010110110110100000 |
3 | 1110200212200220012202121010 |
4 | 2203022030121112312200 |
5 | 2432200111321200000 |
6 | 35502453420500520 |
7 | 2235025160235123 |
oct | 243121431266640 |
9 | 43625626182533 |
10 | 11212220100000 |
11 | 3633091a43107 |
12 | 13110059aa740 |
13 | 63440037bb1a |
14 | 2aa9625aa3ba |
15 | 1469c7878d50 |
hex | a328c656da0 |
11212220100000 has 144 divisors (see below), whose sum is σ = 36787743621216. Its totient is φ = 2989925280000.
The previous prime is 11212220099981. The next prime is 11212220100013. The reversal of 11212220100000 is 102221211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18387034 + ... + 18987033.
It is an arithmetic number, because the mean of its divisors is an integer number (255470441814).
Almost surely, 211212220100000 is an apocalyptic number.
11212220100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11212220100000 is an abundant number, since it is smaller than the sum of its proper divisors (25575523521216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212220100000 is an frugal number, since it uses more digits than its factorization.
11212220100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37374105 (or 37374077 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11212220100000 its reverse (102221211), we get a palindrome (11212322321211).
The spelling of 11212220100000 in words is "eleven trillion, two hundred twelve billion, two hundred twenty million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •