Base | Representation |
---|---|
bin | 1010001101001110000111… |
… | …1001000100111001001000 |
3 | 1110201211120111201121212222 |
4 | 2203103201321010321020 |
5 | 2432331124032204000 |
6 | 35511232232353212 |
7 | 2235531451421345 |
oct | 243234171047110 |
9 | 43654514647788 |
10 | 11222244413000 |
11 | 3637366453905 |
12 | 1312b42b45808 |
13 | 63533a0cc88a |
14 | 2ab233a5b7cc |
15 | 146db293aa85 |
hex | a34e1e44e48 |
11222244413000 has 32 divisors (see below), whose sum is σ = 26260051928760. Its totient is φ = 4488897764800.
The previous prime is 11222244412999. The next prime is 11222244413011. The reversal of 11222244413000 is 31444222211.
It can be written as a sum of positive squares in 4 ways, for example, as 556572697444 + 10665671715556 = 746038^2 + 3265834^2 .
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 7 ways as a sum of consecutive naturals, for example, 5611121207 + ... + 5611123206.
Almost surely, 211222244413000 is an apocalyptic number.
11222244413000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222244413000 is an abundant number, since it is smaller than the sum of its proper divisors (15037807515760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222244413000 is a wasteful number, since it uses less digits than its factorization.
11222244413000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11222244434 (or 11222244420 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 11222244413000 its reverse (31444222211), we get a palindrome (11253688635211).
The spelling of 11222244413000 in words is "eleven trillion, two hundred twenty-two billion, two hundred forty-four million, four hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •