Base | Representation |
---|---|
bin | 1010001101001101010000… |
… | …0010111010100010011100 |
3 | 1110201210222022121110110100 |
4 | 2203103110002322202130 |
5 | 2432330140100023004 |
6 | 35511153213341100 |
7 | 2235522631040142 |
oct | 243232402724234 |
9 | 43653868543410 |
10 | 11222012111004 |
11 | 3637257308992 |
12 | 1312a99197790 |
13 | 635300c45886 |
14 | 2ab210c6b592 |
15 | 146d9c350739 |
hex | a34d40ba89c |
11222012111004 has 18 divisors (see below), whose sum is σ = 28366752836240. Its totient is φ = 3740670703656.
The previous prime is 11222012111003. The next prime is 11222012111021. The reversal of 11222012111004 is 40011121022211.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222012111003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 155861279284 + ... + 155861279355.
Almost surely, 211222012111004 is an apocalyptic number.
It is an amenable number.
11222012111004 is an abundant number, since it is smaller than the sum of its proper divisors (17144740725236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222012111004 is a wasteful number, since it uses less digits than its factorization.
11222012111004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311722558649 (or 311722558644 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11222012111004 its reverse (40011121022211), we get a palindrome (51233133133215).
The spelling of 11222012111004 in words is "eleven trillion, two hundred twenty-two billion, twelve million, one hundred eleven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •