Base | Representation |
---|---|
bin | 1010001100000011100001… |
… | …1101101011001010001110 |
3 | 1110122220220010001012220100 |
4 | 2203000320131223022032 |
5 | 2432014122313323042 |
6 | 35454121343031530 |
7 | 2234222335002510 |
oct | 243007035531216 |
9 | 43586803035810 |
10 | 11202222011022 |
11 | 3629921313959 |
12 | 130b09559b5a6 |
13 | 633498bb0443 |
14 | 2aa2947c3bb0 |
15 | 1465dec4724c |
hex | a303876b28e |
11202222011022 has 96 divisors (see below), whose sum is σ = 29618008662528. Its totient is φ = 2990279654208.
The previous prime is 11202222010981. The next prime is 11202222011027. The reversal of 11202222011022 is 22011022220211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11202222010986 and 11202222011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202222011027) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 44823073 + ... + 45072300.
It is an arithmetic number, because the mean of its divisors is an integer number (308520923568).
Almost surely, 211202222011022 is an apocalyptic number.
11202222011022 is an abundant number, since it is smaller than the sum of its proper divisors (18415786651506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202222011022 is a wasteful number, since it uses less digits than its factorization.
11202222011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89895454 (or 89895451 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11202222011022 its reverse (22011022220211), we get a palindrome (33213244231233).
The spelling of 11202222011022 in words is "eleven trillion, two hundred two billion, two hundred twenty-two million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •