Base | Representation |
---|---|
bin | 1010000110001110010000… |
… | …0101110001100110110110 |
3 | 1110022100021000110000221200 |
4 | 2201203210011301212312 |
5 | 2423343420141241042 |
6 | 35340110521353330 |
7 | 2224044313524600 |
oct | 241434405614666 |
9 | 43270230400850 |
10 | 11102022212022 |
11 | 35a0383122915 |
12 | 12b3790938846 |
13 | 626bbab87051 |
14 | 2a54aadd4170 |
15 | 143bc81e2c4c |
hex | a18e41719b6 |
11102022212022 has 72 divisors (see below), whose sum is σ = 29198219961456. Its totient is φ = 3034093021344.
The previous prime is 11102022212011. The next prime is 11102022212027. The reversal of 11102022212022 is 22021222020111.
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 = 11102022211986 and 11102022212004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102022212027) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 273617253 + ... + 273657824.
It is an arithmetic number, because the mean of its divisors is an integer number (405530832798).
Almost surely, 211102022212022 is an apocalyptic number.
11102022212022 is an abundant number, since it is smaller than the sum of its proper divisors (18096197749434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102022212022 is a wasteful number, since it uses less digits than its factorization.
11102022212022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 547275122 (or 547275112 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11102022212022 its reverse (22021222020111), we get a palindrome (33123244232133).
The spelling of 11102022212022 in words is "eleven trillion, one hundred two billion, twenty-two million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •