Base | Representation |
---|---|
bin | 1010000001100100111011… |
… | …1110001010101010111110 |
3 | 1110000201020211120102202220 |
4 | 2200121032332022222332 |
5 | 2421041442004013042 |
6 | 35235311150230210 |
7 | 2215220443445334 |
oct | 240311676125276 |
9 | 43021224512686 |
10 | 11022211001022 |
11 | 356a547841801 |
12 | 12a02181b5366 |
13 | 61c50bbb2700 |
14 | 2a169935db54 |
15 | 141aa65b68ec |
hex | a064ef8aabe |
11022211001022 has 48 divisors (see below), whose sum is σ = 23903423107200. Its totient is φ = 3386784319776.
The previous prime is 11022211000943. The next prime is 11022211001023. The reversal of 11022211001022 is 22010011222011.
It is a junction number, because it is equal to n+sod(n) for n = 11022211000992 and 11022211001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022211001023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6738772 + ... + 8213127.
It is an arithmetic number, because the mean of its divisors is an integer number (497987981400).
Almost surely, 211022211001022 is an apocalyptic number.
11022211001022 is an abundant number, since it is smaller than the sum of its proper divisors (12881212106178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022211001022 is a wasteful number, since it uses less digits than its factorization.
11022211001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14952657 (or 14952644 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11022211001022 its reverse (22010011222011), we get a palindrome (33032222223033).
The spelling of 11022211001022 in words is "eleven trillion, twenty-two billion, two hundred eleven million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •