Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1111010000011001000000 |
3 | 1102222122220000020000111222 |
4 | 2200032333333100121000 |
5 | 2420401440341210422 |
6 | 35230252522254212 |
7 | 2214351231326135 |
oct | 240167777203100 |
9 | 42878800200458 |
10 | 11011222210112 |
11 | 356591896a523 |
12 | 129a070057368 |
13 | 61b47a3b1077 |
14 | 2a0d35b6a58c |
15 | 1416619dd842 |
hex | a03bffd0640 |
11011222210112 has 224 divisors, whose sum is σ = 24351015080448. Its totient is φ = 4913628217344.
The previous prime is 11011222210057. The next prime is 11011222210133. The reversal of 11011222210112 is 21101222211011.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1659062858 + ... + 1659069494.
It is an arithmetic number, because the mean of its divisors is an integer number (108709888752).
Almost surely, 211011222210112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11011222210112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12175507540224).
11011222210112 is an abundant number, since it is smaller than the sum of its proper divisors (13339792870336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011222210112 is a wasteful number, since it uses less digits than its factorization.
11011222210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7253 (or 7243 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11011222210112 its reverse (21101222211011), we get a palindrome (32112444421123).
The spelling of 11011222210112 in words is "eleven trillion, eleven billion, two hundred twenty-two million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •