Base | Representation |
---|---|
bin | 1010001101001110010111… |
… | …1011010010110011001000 |
3 | 1110201211202020002122021011 |
4 | 2203103211323102303020 |
5 | 2432331243344244422 |
6 | 35511243051253304 |
7 | 2235533232654535 |
oct | 243234573226310 |
9 | 43654666078234 |
10 | 11222312103112 |
11 | 36373a0687450 |
12 | 1312b6174a234 |
13 | 63534b13cbb6 |
14 | 2ab23ca3bd8c |
15 | 146db885c077 |
hex | a34e5ed2cc8 |
11222312103112 has 16 divisors (see below), whose sum is σ = 22954729302000. Its totient is φ = 5101050955920.
The previous prime is 11222312103103. The next prime is 11222312103127. The reversal of 11222312103112 is 21130121322211.
It is a happy number.
11222312103112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63763136862 + ... + 63763137037.
It is an arithmetic number, because the mean of its divisors is an integer number (1434670581375).
Almost surely, 211222312103112 is an apocalyptic number.
It is an amenable number.
11222312103112 is an abundant number, since it is smaller than the sum of its proper divisors (11732417198888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222312103112 is a wasteful number, since it uses less digits than its factorization.
11222312103112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127526273916 (or 127526273912 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11222312103112 its reverse (21130121322211), we get a palindrome (32352433425323).
The spelling of 11222312103112 in words is "eleven trillion, two hundred twenty-two billion, three hundred twelve million, one hundred three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •