Base | Representation |
---|---|
bin | 1010000110110011100000… |
… | …1000000001011110000110 |
3 | 1110100022001220212000110000 |
4 | 2201230320020001132012 |
5 | 2424024410114201042 |
6 | 35344443100142130 |
7 | 2224550156515605 |
oct | 241547010013606 |
9 | 43308056760400 |
10 | 11112022022022 |
11 | 35a46448180a9 |
12 | 12b5701837946 |
13 | 627b22808b9c |
14 | 2a5b79107a3c |
15 | 1440b106474c |
hex | a1b38201786 |
11112022022022 has 40 divisors (see below), whose sum is σ = 25036724945232. Its totient is φ = 3683543202000.
The previous prime is 11112022022011. The next prime is 11112022022027. The reversal of 11112022022022 is 22022022021111.
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 = 11112022021986 and 11112022022004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112022022027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 189453354 + ... + 189511997.
Almost surely, 211112022022022 is an apocalyptic number.
11112022022022 is an abundant number, since it is smaller than the sum of its proper divisors (13924702923210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112022022022 is a wasteful number, since it uses less digits than its factorization.
11112022022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378965546 (or 378965537 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11112022022022 its reverse (22022022021111), we get a palindrome (33134044043133).
The spelling of 11112022022022 in words is "eleven trillion, one hundred twelve billion, twenty-two million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •