Base | Representation |
---|---|
bin | 1010001100100000111010… |
… | …1111101011001011010000 |
3 | 1110200200020222111021010112 |
4 | 2203020032233223023100 |
5 | 2432131302134134300 |
6 | 35501504313220452 |
7 | 2234622011662601 |
oct | 243101657531320 |
9 | 43620228437115 |
10 | 11210112021200 |
11 | 36321aaa97324 |
12 | 1310717a01728 |
13 | 6341556c2a11 |
14 | 2aa802619da8 |
15 | 146902767e35 |
hex | a320ebeb2d0 |
11210112021200 has 30 divisors (see below), whose sum is σ = 26932294131894. Its totient is φ = 4484044808320.
The previous prime is 11210112021191. The next prime is 11210112021217. The reversal of 11210112021200 is 212021101211.
It can be written as a sum of positive squares in 3 ways, for example, as 2317835733136 + 8892276288064 = 1522444^2 + 2981992^2 .
It is a super-2 number, since 2×112101120212002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14012639627 + ... + 14012640426.
Almost surely, 211210112021200 is an apocalyptic number.
11210112021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11210112021200 is an abundant number, since it is smaller than the sum of its proper divisors (15722182110694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210112021200 is a wasteful number, since it uses less digits than its factorization.
11210112021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28025280071 (or 28025280060 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11210112021200 its reverse (212021101211), we get a palindrome (11422133122411).
The spelling of 11210112021200 in words is "eleven trillion, two hundred ten billion, one hundred twelve million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •